Gödel Incompleteness
Definition
The result that any sufficiently strong recursively enumerable axiom system has undecidable statements P (neither P nor not-P provable), and that adding a Tarskian truth predicate yields a strictly larger but still incomplete system.
Cast within
No topic-region cast yet — this appears once Gödel Incompleteness's compiled claims are aligned into a topic region's argument tree.
Claims mentioning Gödel Incompleteness (2)
Your notes
Loading notes...