The finite inseparability of the first-order theory of diagonalisable algebras

DOI10.1007/BF00403334MaRDI QIDQ795036zbMATH OpenOpenAlexFDO

Authors Craig Smoryński

Publication date 1982

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00403334

zbMATH Keywords

finite inseparabilityfirst order theory of diagonalizable algebrasmodal logic of provabilityprovability predicate for Peano Arithmetic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Undecidability and degrees of sets of sentences (03D35) Logical aspects of Boolean algebras (03G05) Other algebras related to logic (03G25)

Review text

In this paper, the author proves the finite inseparability of the first order theory of diagonalizable algebras (shortly: DAs). DAs constitute the algebraic analogue of the modal logic of provability, and can be considered as an algebraic approach to the study of the provability predicate for Peano Arithmetic or related theories. Smoryński's proof uses a result of \textit{Yu. L. Ershov} and \textit{M. A. Taj'tslin}, who proved the finite inseparability of the theory of distributive lattices [Algebra Logika, Sem. 2, No.5, 37-41 (1963; Zbl 0192.056)]. The undecidability of the first order theory of diagonalizable algebras was proved by the reviewer by direct means [Stud. Logica 39, 355-359 (1980; Zbl 0463.03016)]. Of course, Smoryński's result is stronger (it implies the undecidability of the first order theory of finite DAs); however, it does not solve the problem of the decidability or undecidability of the Lindenbaum DA of Peano Arithmetic.

Recommendations

• Undecidability in diagonalizable algebras
• On the autological character of diagonalizable algebras
• On propositional quantifiers in provability logic
• scientific article; zbMATH DE number 219032
• A note on the diagonalizable algebras of PA and ZF

Cites work

• Fixed point algebras
• scientific article; zbMATH DE number 3485746 (Why is no real title available?)
• Provability interpretations of modal logic
• Representation and duality theory for diagonalizable algebras. (The algebraization of theories which express Theor. IV.)
• Sentences true in all constructive models
• The undecidability of the first-order theory of diagonalizable algebras

Cited in

(8)

• On the autological character of diagonalizable algebras
• Linear \(\mathrm{GLP}\)-algebras and their elementary theories
• Franco Montagna's work on provability logic and many-valued logic
• Fixed point algebras
• Undecidability in diagonalizable algebras
• Decoding in the automorphism group of a recursively saturated model of arithmetic
• A note on the diagonalizable algebras of PA and ZF
• The Lindenbaum fixed point algebra is undecidable

This page was built for publication: The finite inseparability of the first-order theory of diagonalisable algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795036)