Decidable properties of finite sets of equations in trivial languages

Journal of Symbolic Logic 49 (4):1333-1338 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274282

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Undecidable properties of finite sets of equations.George F. McNulty - 1976 - Journal of Symbolic Logic 41 (3):589-604.
Decision problems concerning properties of finite sets of equations.Cornelia Kalfa - 1986 - Journal of Symbolic Logic 51 (1):79-87.
Review: V. L. Murskii, D. M. Pritzker, Nondiscernible Properties of Finite Systems of Identity Relations; George F. McNulty, The Decision Problem for Equational Bases of Algebras; George F. McNulty, Undecidable Properties of Finite Sets of Equations. [REVIEW]S. Burris - 1982 - Journal of Symbolic Logic 47 (4):903-904.
V. L. MurskiĬ. Nondiscernible properties of finite systems of identity relations. Soviet mathematics, vol. 12 , pp. 183–186. , pp. 520–522.) - George F. McNulty. The decision problem for equational bases of algebras. Annals of mathematical logic, vol. 10 , pp. 193–259. - George F. McNulty. Undecidable properties of finite sets of equations. The journal of symbolic logic, vol. 41 , pp. 589–604. [REVIEW]S. Burris - 1982 - Journal of Symbolic Logic 47 (4):903-904.
Decidability problem for finite Heyting algebras.Katarzyna Idziak & Pawel M. Idziak - 1988 - Journal of Symbolic Logic 53 (3):729-735.
Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets.James H. Schmerl - 1981 - Journal of Symbolic Logic 46 (1):101 - 120.
Finite algebras of relations are representable on finite sets.H. Andreka, I. Hodkinson & I. Nemeti - 1999 - Journal of Symbolic Logic 64 (1):243-267.
A decidable variety that is finitely undecidable.Joohee Jeong - 1999 - Journal of Symbolic Logic 64 (2):651-677.

Analytics

Added to PP
2009-01-28

Downloads
30 (#749,901)

6 months
10 (#404,653)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references