Undecidability in diagonalizable algebras

DOI10.2307/2275733zbMATH Open0876.03006OpenAlexW2145210098MaRDI QIDQ4338316FDOQ4338316

Authors: V. Yu. Shavrukov 

Publication date: 18 August 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275733

Recommendations

• The finite inseparability of the first-order theory of diagonalisable algebras
• Decision problems for classes of diagonalizable algebras
• On propositional quantifiers in provability logic
• scientific article; zbMATH DE number 3928996

zbMATH Keywords

undecidabilitydiagonalizable algebrafirst order theoriesupper bounds on undecidable quantifier alternations

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Other algebras related to logic (03G25) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Title not available (Why is that?)
• Provability interpretations of modal logic
• Interpretations of the first-order theory of diagonalizable algebras in Peano arithmetic
• 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.)
• On propositional quantifiers in provability logic
• Shavrukov's theorem on the subalgebras of diagonalizable algebras for theories containing \(I\Delta_ 0 + \exp\)
• The interpretability logic of Peano arithmetic
• The finite inseparability of the first-order theory of diagonalisable algebras
• FINITENESS OF $ E(\mathbf{Q})$ AND $ \textrm{Ø}(E,\mathbf{Q})$ FOR A SUBCLASS OF WEIL CURVES
• Self-reference and modal logic
• Minimal elements of \(\text{И}(H;p)\) and conjugacy of Levi complements in finite Chevalley groups.
• Fixed point algebras
• Universality of Tag Systems with P = 2
• A generalized notion of weak interpretability and the corresponding modal logic
• A note on the diagonalizable algebras of PA and ZF
• On the proofs of arithmetical completeness for interpretability logic
• The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
• The logic of linear tolerance
• On bimodal logics of provability

Cited In (19)

• Diophantine undecidability of \({\mathbb{C}{}}(t_ 1,t_ 2)\)
• A note on the diagonalizable algebras of PA and ZF
• Undecidability of relatively free Hilbert algebras
• Title not available (Why is that?)
• Linear \(\mathrm{GLP}\)-algebras and their elementary theories
• Title not available (Why is that?)
• Iterated Extensional Rosser's Fixed Points and Hyperhyperdiagonalizable Algebras
• Franco Montagna's work on provability logic and many-valued logic
• The finite inseparability of the first-order theory of diagonalisable algebras
• Fixed points and unfounded chains
• On the autological character of diagonalizable algebras
• Title not available (Why is that?)
• Undecidable theories of Lyndon algebras
• On a strengthening of the non-isomorphism theorem for provability algebras
• Title not available (Why is that?)
• Effectively inseparable Boolean algebras in lattices of sentences
• Decision problems for classes of diagonalizable algebras
• Hyperdiagonalizable algebras
• ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS

This page was built for publication: Undecidability in diagonalizable algebras

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