Passive induction and a solution to a Paris-Wilkie open question

DOI10.1016/j.apal.2007.01.003zbMath1115.03083OpenAlexW1996215903MaRDI QIDQ882120

Dan E. Willard

Publication date: 23 May 2007

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.2007.01.003

zbMATH Keywords

semantic tableauxHerbrand deductionincompleteness theorem

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items (6)

2011 North American Annual Meeting of the Association for Symbolic Logic ⋮ Herbrand consistency of some finite fragments of bounded arithmetical theories ⋮ Herbrand consistency of some arithmetical theories ⋮ 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

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
• 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
• Unprovability of consistency statements in fragments of bounded arithmetic
• A generalization of the second incompleteness theorem and some exceptions to it
• Derivability conditions on Rosser's provability predicates
• Undecidable theories
• Existentially closed structures and Gödel's second incompleteness theorem
• Self-verifying axiom systems, the incompleteness theorem and related reflection principles
• Herbrand consistency and bounded arithmetic
• Solution of a problem of Leon Henkin
• Arithmetization of metamathematics in a general setting
• A note on the undefinability of cuts
• On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
• 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Δ₀ + Ω₁ with a prepositional constant for EXP
• Gödel's Second incompleteness theorem for Q
• 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
• The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem
• On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
• An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
• On Herbrand consistency in weak arithmetic

This page was built for publication: Passive induction and a solution to a Paris-Wilkie open question