Self-verifying theories
Self-verifying theories are consistent first-order systems of arithmetic much weaker than Peano arithmetic that are capable of proving their own consistency. Dan Willard was the first to investigate their properties, and he has described a family of such systems. According to Gödel's incompleteness theorem, these systems cannot contain the theory of Peano arithmetic, and in fact, not even the weak fragment of Robinson arithmetic; nonetheless, they can contain strong theorems. sentence expressing totality of multiplication: where is the three-place predicate which stands for We can add any true
Wikipage redirect
primaryTopic
Self-verifying theories
Self-verifying theories are consistent first-order systems of arithmetic much weaker than Peano arithmetic that are capable of proving their own consistency. Dan Willard was the first to investigate their properties, and he has described a family of such systems. According to Gödel's incompleteness theorem, these systems cannot contain the theory of Peano arithmetic, and in fact, not even the weak fragment of Robinson arithmetic; nonetheless, they can contain strong theorems. sentence expressing totality of multiplication: where is the three-place predicate which stands for We can add any true
has abstract
Self-verifying theories are co ...... y and still remain consistent.
@en
自己検証理論 (英語: Self-verifying the ...... いかなる真の 文を追加しても、なお無矛盾であるようにできる。
@ja
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
606,600,583
comment
Self-verifying theories are co ...... stands for We can add any true
@en
自己検証理論 (英語: Self-verifying the ...... いかなる真の 文を追加しても、なお無矛盾であるようにできる。
@ja
label
Self-verifying theories
@en
自己検証理論
@ja