Timeline for Does there exist inconsistent axiom schemata which require arbitrary long proofs of their inconsistency?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2016 at 10:06 | comment | added | Emil Jeřábek | Predicate logic with one binary relation symbol is undecidable because there exist finitely axiomatized undecidable theories in the language of set theory, which in turn follows because only finitely many axioms of ZFC are needed to interpret a finitely axiomatized essentially undecidable theory such as Robinson's arithmetic. That is, the argument that shows that first-order logic is undecidable in the first place already applies to a language with one binary relation. | |
| Aug 27, 2016 at 6:37 | vote | accept | CommunityBot | ||
| Aug 26, 2016 at 16:17 | history | edited | Noah Schweber | CC BY-SA 3.0 |
added 259 characters in body
|
| Aug 26, 2016 at 16:09 | history | edited | Noah Schweber | CC BY-SA 3.0 |
added 2412 characters in body
|
| Aug 26, 2016 at 16:04 | history | edited | Noah Schweber | CC BY-SA 3.0 |
added 2412 characters in body
|
| Aug 26, 2016 at 15:44 | history | answered | Noah Schweber | CC BY-SA 3.0 |