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. Journal of Symbolic Logic.

Type

Journal article

Intellectual base

Primary research

Year

2002

DOI

10.2178/jsl/1190150055

DOI registrant

Cambridge University Press

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

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