Incompleteness theorems prove that there are
logically undecidable propositions, i.e., that there are propositions that are
neither provable nor disprovable in certain classes of theories.
Incompleteness of Principia Mathematica was proved informally using proof by
contradiction in a stratified metatheory by GÃ¶del [1931] with restrictive
conditions. Then Rosser [1936] informally proved incompleteness using proof by
contradiction in a stratified metatheory assuming consistency of Principia
Mathematica.
However, information on the modern Internet is pervasively inconsistent and
restricting reasoning to use only stratified metatheories is impractical.
Consequently Direct Logic has been developed which is inconsistency tolerant
and does without stratified metatheories. And incompleteness has been formally
self-proved for every theory of Direct Logic without requiring the hypothesis
of consistency. Moreover, because incompleteness is self-proved, logically
necessary inconsistency immediately follows.
Contents
Recent comments
56 min 52 sec ago
3 hours 44 min ago
4 hours 6 min ago
4 hours 50 min ago
5 hours 46 min ago
5 hours 48 min ago
6 hours 20 min ago
7 hours 46 min ago
10 hours 20 min ago
12 hours 37 min ago