Timeline for A question about sentences undecidable in Peano's Arithmetic
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25, 2015 at 19:30 | answer | added | none | timeline score: 0 | |
| Jul 24, 2015 at 17:43 | vote | accept | Garabed Gulbenkian | ||
| Jul 24, 2015 at 12:42 | answer | added | none | timeline score: 0 | |
| Jul 24, 2015 at 2:28 | comment | added | user76367 | You can formalize the sentence "SOA is consistent" in PA. That sentence is of course undecidable in SOA. | |
| Jul 23, 2015 at 18:43 | answer | added | Andreas Blass | timeline score: 5 | |
| Jul 23, 2015 at 17:59 | comment | added | Christian Remling | You need to be more specific about which type of second order semantics you want to use. In full SOA, $\omega$ is the only model, but then you don't have a complete proof calculus as in first order logic. | |
| Jul 23, 2015 at 17:49 | history | asked | Garabed Gulbenkian | CC BY-SA 3.0 |