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

DOI10.1007/BF00403334zbMath0542.03024OpenAlexW2048339526MaRDI QIDQ795036

Craig Smorynski

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) Other algebras related to logic (03G25) Logical aspects of Boolean algebras (03G05)

Related Items (6)

Franco Montagna's work on provability logic and many-valued logic ⋮ Linear $ \mathrm{GLP}$-algebras and their elementary theories ⋮ Undecidability in diagonalizable algebras ⋮ Fixed point algebras ⋮ Decoding in the automorphism group of a recursively saturated model of arithmetic ⋮ The Lindenbaum fixed point algebra is undecidable

Cites Work

• Unnamed Item
• The undecidability of the first-order theory of diagonalizable algebras
• Provability interpretations of modal logic
• Representation and duality theory for diagonalizable algebras. (The algebraization of theories which express Theor. IV.)
• Fixed point algebras
• Sentences true in all constructive models

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