A generalization of the second incompleteness theorem and some exceptions to it
From MaRDI portal
Publication:2500470
DOI10.1016/j.apal.2005.12.010zbMath1103.03059OpenAlexW2071373355MaRDI QIDQ2500470
Publication date: 16 August 2006
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2005.12.010
First-order arithmetic and fragments (03F30) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (7)
Passive induction and a solution to a Paris-Wilkie open question ⋮ The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem ⋮ Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem ⋮ 2007-2008 Winter Meeting of the Association for Symbolic Logic ⋮ 2008 Annual Meeting of the Association for Symbolic Logic ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The unprovability of small inconsistency. A study of local and global interpretability
- Faith \& falsity
- Proof theory. 2nd ed
- On the scheme of induction for bounded arithmetic formulas
- Bounded arithmetic and the polynomial hierarchy
- The complexity of the pigeonhole principle
- Unprovability of consistency statements in fragments of bounded arithmetic
- Undecidable theories
- Self-verifying axiom systems, the incompleteness theorem and related reflection principles
- Herbrand consistency and bounded arithmetic
- A note on the undefinability of cuts
- Modal analysis of generalized rosser sentences
- A note on bounded arithmetic
- Cuts, consistency statements and interpretations
- A note on proofs of falsehood
- An inside view of EXP; or, The closed fragment of the provability logic of IΔ0 + Ω1 with a prepositional constant for EXP
- Gödel's Second incompleteness theorem for Q
- Rudimentary Predicates and Relative Computation
- Gödel sentences of bounded arithmetic
- How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic q
- Automated Reasoning with Analytic Tableaux and Related Methods
- An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
- Existence and feasibility in arithmetic
- Consistency statements in formal theories
- On Herbrand consistency in weak arithmetic
This page was built for publication: A generalization of the second incompleteness theorem and some exceptions to it
