Self-verifying axiom systems, the incompleteness theorem and related reflection principles

  title={Self-verifying axiom systems, the incompleteness theorem and related reflection principles},
  author={Dan E. Willard},
  journal={Journal of Symbolic Logic},
  pages={536 - 596}
  • D. Willard
  • Published 1 June 2001
  • Mathematics
  • Journal of Symbolic Logic
Abstract We will study several weak axiom systems that use the Subtraction and Division primitives (rather than Addition and Multiplication) to formally encode the theorems of Arithmetic. Provided such axiom systems do not recognize Multiplication as a total function, we will show that it is feasible for them to verify their Semantic Tableaux, Herbrand, and Cut-Free consistencies. If our axiom systems additionally do not recognize Addition as a total function, they will be capable of… 
On the available partial respects in which an axiomatization for real valued arithmetic can recognize its consistency
  • D. Willard
  • Computer Science
    Journal of Symbolic Logic
  • 2006
It is shown that axiomatizations for a computer's floating point arithmetic can recognize their cut-free consistency in a stronger respect than is feasible under integer arithmetics.
On the Nature of Godel's Second Incompleteness Theorem
Godel’s “Second” Incompleteness Theorem states that axiom systems of sufficiently great strength are unable to formally verify their own consistency. Let A(x, y, z) denote a 3-way predicate relation
About the characterization of a fine line that separates generalizations and boundary-case exceptions for the Second Incompleteness Theorem under semantic tableau deduction
Our previous research showed that the semantic tableau deductive methodology of Fitting and Smullyan permits boundary-case exceptions to the second incompleteness theorem, if multiplication is
On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency
It is shown Godel's Second Incompleteness Theorem does not preclude axiomizations for a computer’s floating point arithmetic from recognizing their own consistency in certain well defined partial respects.
On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction
This work shows that if one promotes this schema of theorems into formalized logical axioms, then the meaning of the pronoun “I” in the self-referencing engine changes, and the partial evasions of the Second Incompleteness Theorem come to a complete halt.
A weak set theory that proves its own consistency
This example avoids the strong version of Godel second incompleteness theorem (due to Pudlak) that asserts that no consistent a theory interpreting Robinson's arithmetic $\mathsf{Q}$ proves its own consistency.
The Consistency of Arithmetic
  • T. Chow
  • Philosophy
    The Mathematical Intelligencer
  • 2018
In 2010, Vladimir Voevodsky gave a lecture on "What If Current Foundations of Mathematics Are Inconsistent?" Among other things he said that he was seriously suspicious that an inconsistency in PA
Some New Exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem
This article continues our study of axiom systems that can verify their own consistency and prove all Peano Arithmetic's ?1 theorems. We will develop some new types of exceptions for the Semantic


Self-Verifying Axiom Systems
We introduce a class of First Order axiom systems which can simultaneously verify their own consistency and prove more Π1 theorems than Peano Arithmetic. Despite these strengths, our axiom systems do
The Tangibility Reflection Principle for Self-Verifying Axiom Systems
This work extends some axiom systems that could verify their own consistency and prove all Peano Arithmetic's II1 theorems by introducing some new axiom system which use stronger definitions of self-consistency.
First-Order Logic and Automated Theorem Proving
  • M. Fitting
  • Computer Science
    Graduate Texts in Computer Science
  • 1996
This monograph on classical logic presents fundamental concepts and results in a rigorous mathematical style and is intended for those interested in computer science and mathematics at the beginning graduate level.
Godel's Second Incompleteness Theorem for Q
For the first Godel incompleteness theorem, the existence in a formal system of arithmetic L of a sentence which is neither provable nor refutable, all that is required of the formula Th( x ) of L
Solution of a Problem of Leon Henkin
  • M. H. Lob
  • Mathematics, Philosophy
    J. Symb. Log.
  • 1955
This note presents a solution of the previous problem with respect to the system Z μ, and, more generally, to any system whose set of theorems is closed under the rules of inference of the first order predicate calculus, and satisfies the subsequent five conditions, and in which the function ( k, l ) used below is definable.
The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson's Arithmetic Q
The Second Incompleteness Theorem is generalized almost to the level of Robinson’s System Q, such that if α is any finite consistent extension of Q +V then α will be unable to prove its Semantic Tableaux consistency.
Bounded Arithmetic と計算量の根本問題
59.4 T h e C u t Elimination Theorem for Second Order Logic 171 (respectively, v . ) . In particular, (a) guarantees t h a t *"-PIND or c ~ ' ~ I N D , and C ~ ' ~ C R inferences are still valid
Cuts, Consistency Statements and Interpretations
The importance of cuts for interpretations in GB was realized already by Vopěnka and Hajek in [30], and Pioneering work was done by Solovay in [24], where he developed the method of “ shortening of cuts ”.