How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic Q¶

Willard, D. E. (2002). How to extend the semantic tableaux and cut-free versions of the second incompleteness theorem almost to Robinson's arithmetic Q.

Type: Unclassified
Intellectual base: Unclassified
Year: 2002
DOI: 10.2178/jsl/1190150055
Link: https://doi.org/10.2178/jsl/1190150055

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Self-verifying theories
- … addition-like resources and a self-justifying axiom scheme but restricts multiplication or proof machinery enough to evade ordinary second-incompleteness hypotheses. to A proof states the exact consistency formula, language and deduction method because stronger encodings can restore the incompleteness barrier..

Verification¶

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:011dae25e5f0 · see in the full table