The finite inseparability of the first-order theory of diagonalisable algebras
From MaRDI portal
Publication:795036
DOI10.1007/BF00403334zbMath0542.03024MaRDI QIDQ795036
Publication date: 1982
Published in: Studia Logica (Search for Journal in Brave)
finite inseparability; first order theory of diagonalizable algebras; modal logic of provability; provability predicate for Peano Arithmetic
03B45: Modal logic (including the logic of norms)
03D35: Undecidability and degrees of sets of sentences
03G25: Other algebras related to logic
03G05: Logical aspects of Boolean algebras
Related Items
Undecidability in diagonalizable algebras, Decoding in the automorphism group of a recursively saturated model of arithmetic, Franco Montagna's work on provability logic and many-valued logic, The Lindenbaum fixed point algebra is undecidable, Linear $ \mathrm{GLP}$-algebras and their elementary theories, Fixed point algebras
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