The lindenbaum fixed point algebra is undecidable

Studia Logica 50 (1):143-147 (1991)
  Copy   BIBTEX

Abstract

We prove that the first order theory of the fixed point algebra corresponding to an r.e. consistent theory containing arithmetic is hereditarily undecidable

Categories

Keywords

Reprint years

DOI

10.1007/bf00370392

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,859

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

Decision problems for classes of diagonalizable algebras.Aldo Ursini - 1985 - Studia Logica 44 (1):87 - 89.
Undecidability in diagonalizable algebras.V. Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.
Topological Structure of Diagonalizable Algebras and Corresponding Logical Properties of Theories.Giovanna D'Agostino - 1994 - Notre Dame Journal of Formal Logic 35 (4):563-572.
The uniqueness of the fixed-point in every diagonalizable algebra.Claudio Bernardi - 1976 - Studia Logica 35 (4):335 - 343.
Undecidable semiassociative relation algebras.Roger D. Maddux - 1994 - Journal of Symbolic Logic 59 (2):398-418.
Orthoimplication algebras.J. C. Abbott - 1976 - Studia Logica 35 (2):173 - 177.
Essential hereditary undecidability.Albert Visser - 2024 - Archive for Mathematical Logic 63 (5):529-562.
The semijoin algebra and the guarded fragment.Dirk Leinders, Maarten Marx, Jerzy Tyszkiewicz & Jan Van den Bussche - 2005 - Journal of Logic, Language and Information 14 (3):331-343.
On the λY calculus.Rick Statman - 2004 - Annals of Pure and Applied Logic 130 (1-3):325-337.
A finite relation algebra with undecidable network satisfaction problem.Robin Hirsch - 1999 - Logic Journal of the IGPL 7 (4):547-554.

Analytics

Added to PP
2009-01-28

Downloads
37 (#680,142)

6 months
1 (#1,599,047)

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

Self-Reference and Modal Logic.[author unknown] - 1987 - Studia Logica 46 (4):395-398.
A Completeness Result for Fixed‐Point Algebras.Franco Montagna - 1984 - Mathematical Logic Quarterly 30 (32-34):525-532.

Add more references