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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,897

External links

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

Through your library

Similar books and articles

Undecidable properties of finite sets of equations.George F. McNulty - 1976 - Journal of Symbolic Logic 41 (3):589-604.
Timing diagrams: Formalization and algorithmic verification. [REVIEW]Kathi Fisler - 1999 - Journal of Logic, Language and Information 8 (3):323-361.
Decidability problem for finite Heyting algebras.Katarzyna Idziak & Pawel M. Idziak - 1988 - Journal of Symbolic Logic 53 (3):729-735.
The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
The geometry of forking and groups of finite Morley rank.Anand Pillay - 1995 - Journal of Symbolic Logic 60 (4):1251-1259.

Analytics

Added to PP
2009-01-28

Downloads
16 (#906,902)

6 months
5 (#639,324)

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

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.

Add more references