ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
DOI10.1017/S1755020322000302arXiv2110.06712OpenAlexW3207242279WikidataQ114116100 ScholiaQ114116100MaRDI QIDQ6131232FDOQ6131232
Authors: E. A. Kolmakov
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
isomorphismreflection principlesdiagonalizable algebraprovability predicateprovability algebraShavrukov's theorem
First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Cites Work
- Existence and feasibility in arithmetic
- Proof-theoretic analysis by iterated reflection
- Reflection principles and provability algebras in formal arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- Undecidability in diagonalizable algebras
- Title not available (Why is that?)
- The \(\forall \exists \) theory of Peano \(\Sigma_1\) sentences
- Self-reference and modal logic
- Title not available (Why is that?)
- A jump operator on honest subrecursive degrees
- A Classification of the Recursive Functions
- Deduction-preserving "Recursive Isomorphisms" between theories
- Induction rules, reflection principles, and provably recursive functions
- On the structure of the degrees of relative provability
- Title not available (Why is that?)
- A note on the diagonalizable algebras of PA and ZF
- AXIOMATIZATION OF PROVABLE n-PROVABILITY
- A proof-theoretic analysis of collection
- Title not available (Why is that?)
This page was built for publication: ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131232)