Decidable and undecidable prime theories in infinite-valued logic

Annals of Pure and Applied Logic 108 (1-3):269-278 (2001)
  Copy   BIBTEX


In classical propositional logic, a theory T is prime iff it is complete. In Łukasiewicz infinite-valued logic the two notions split, completeness being stronger than primeness. Using toric desingularization algorithms and the fine structure of prime ideal spaces of free ℓ -groups, in this paper we shall characterize prime theories in infinite-valued logic. We will show that recursively enumerable prime theories over a finite number of variables are decidable, and we will exhibit an example of an undecidable r.e. prime theory over countably many variables



    Upload a copy of this work     Papers currently archived: 92,369

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

Degree Spectra of Prime Models.Barbara F. Csima - 2004 - Journal of Symbolic Logic 69 (2):430 - 442.
Finiteness in infinite-valued łukasiewicz logic.Stefano Aguzzoli & Agata Ciabattoni - 2000 - Journal of Logic, Language and Information 9 (1):5-29.
Bounding Prime Models.Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight & Robert I. Soare - 2004 - Journal of Symbolic Logic 69 (4):1117 - 1142.
A decidable variety that is finitely undecidable.Joohee Jeong - 1999 - Journal of Symbolic Logic 64 (2):651-677.
Decidable subspaces and recursively enumerable subspaces.C. J. Ash & R. G. Downey - 1984 - Journal of Symbolic Logic 49 (4):1137-1145.
Unification grammars and off-line parsability.Efrat Jaeger, Nissim Francez & Shuly Wintner - 2005 - Journal of Logic, Language and Information 14 (2):199-234.
Decidable and undecidable logics with a binary modality.ágnes Kurucz, István Németi, Ildikó Sain & András Simon - 1995 - Journal of Logic, Language and Information 4 (3):191-206.
An Undecidable Linear Order That Is $n$-Decidable for All $n$.John Chisholm & Michael Moses - 1998 - Notre Dame Journal of Formal Logic 39 (4):519-526.
Prime models of computably enumerable degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.


Added to PP

33 (#488,210)

6 months
17 (#153,351)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Interpretation of De Finetti coherence criterion in Łukasiewicz logic.Daniele Mundici - 2010 - Annals of Pure and Applied Logic 161 (2):235-245.
Geometry of Robinson consistency in Łukasiewicz logic.Manuela Busaniche & Daniele Mundici - 2007 - Annals of Pure and Applied Logic 147 (1):1-22.
Finite axiomatizability in Łukasiewicz logic.Daniele Mundici - 2011 - Annals of Pure and Applied Logic 162 (12):1035-1047.

Add more citations

References found in this work

Varieties of MV-algebras.Giovanni Panti - 1999 - Journal of Applied Non-Classical Logics 9 (1):141-157.

Add more references