The finite inseparability of the first-order theory of diagonalisable algebras
DOI10.1007/BF00403334zbMATH Open0542.03024OpenAlexW2048339526MaRDI QIDQ795036FDOQ795036
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
Recommendations
finite inseparabilityfirst order theory of diagonalizable algebrasmodal logic of provabilityprovability predicate for Peano Arithmetic
Modal logic (including the logic of norms) (03B45) Other algebras related to logic (03G25) Undecidability and degrees of sets of sentences (03D35) Logical aspects of Boolean algebras (03G05)
Cites Work
- Title not available (Why is that?)
- Provability interpretations of modal logic
- The undecidability of the first-order theory of diagonalizable algebras
- Representation and duality theory for diagonalizable algebras. (The algebraization of theories which express Theor. IV.)
- Sentences true in all constructive models
- Fixed point algebras
Cited In (8)
- A note on the diagonalizable algebras of PA and ZF
- Undecidability in diagonalizable algebras
- Decoding in the automorphism group of a recursively saturated model of arithmetic
- Linear \(\mathrm{GLP}\)-algebras and their elementary theories
- Franco Montagna's work on provability logic and many-valued logic
- On the autological character of diagonalizable algebras
- The Lindenbaum fixed point algebra is undecidable
- Fixed point algebras
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)