ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS

DOI10.1017/s1755020322000302arXiv2110.06712OpenAlexW3207242279WikidataQ114116100 ScholiaQ114116100MaRDI QIDQ6131232

Unnamed Author

Publication date: 4 April 2024

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

Full work available at URL: https://arxiv.org/abs/2110.06712

zbMATH Keywords

isomorphismdiagonalizable algebrareflection principlesprovability predicateprovability algebraShavrukov's theorem

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the diagonalizable algebras of PA and ZF
• Self-reference and modal logic
• A jump operator on honest subrecursive degrees
• A proof-theoretic analysis of collection
• Induction rules, reflection principles, and provably recursive functions
• Proof-theoretic analysis by iterated reflection
• On the structure of the degrees of relative provability
• Reflection principles and provability algebras in formal arithmetic
• Undecidability in diagonalizable algebras
• AXIOMATIZATION OF PROVABLE n-PROVABILITY
• THE ∀∃ THEORY OF PEANO Σ₁ SENTENCES
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Deduction-preserving "Recursive Isomorphisms" between theories
• Existence and feasibility in arithmetic
• A Classification of the Recursive Functions

This page was built for publication: ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS