Arithmetical soundness and completeness for _2 numerations
DOI10.1007/S11225-017-9782-4zbMATH Open1437.03167OpenAlexW2786667107MaRDI QIDQ1756596FDOQ1756596
Authors: Taishi Kurahashi 
Publication date: 21 December 2018
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-017-9782-4
Recommendations
- Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
- Independent numerations of theories and of recursive progressions
- Provability logics relative to a fixed extension of Peano arithmetic
- scientific article; zbMATH DE number 4010488
- On predicate provability logics and binumerations of fragments of Peano arithmetic
provability logicnumerationsarithmetical completeness theoremformalized arithmeticSacchetti's logics
Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Cites Work
- Four valued semantics and the Liar
- Arithmetization of metamathematics in a general setting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Provability interpretations of modal logic
- On the algebraization of a Feferman's predicate. (The algebraization of theories which express Theor; X)
- Peano's smart children: A provability logical study of systems with built-in consistency
- A smart child of Peano's
- Title not available (Why is that?)
- ON THE CLASSIFICATION OF PROPOSITIONAL PROVABILITY LOGICS
- The fixed point property in modal logic
- Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
Cited In (10)
- The persistence principle over weak interpretability logic
- The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
- Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
- Current research on Gödel's incompleteness theorems
- VARIANTS OF KREISEL’S CONJECTURE ON A NEW NOTION OF PROVABILITY
- Interpolation properties for Sacchetti's logics
- Arithmetical completeness theorems for monotonic modal logics
- Another look at the second incompleteness theorem
- Effectively constructible fixed points in Sacchetti's modal logics of provability
- Rosser provability and normal modal logics
This page was built for publication: Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756596)
