Timeline for Can transfinite induction be defined as axiom scheme in FOL on bin-tree structures?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25, 2013 at 3:02 | review | Late answers | |||
| Jun 25, 2013 at 23:36 | |||||
| Dec 18, 2010 at 22:46 | comment | added | Lucas K. | Then the question is, whether Goodstein's theorem can be proven with structural induction. I doubt that. It would mean that FOL + PA + SI (structural induction) can proof Goodstein, while current theorems say that you need second order logic. | |
| Dec 17, 2010 at 5:05 | history | answered | none | CC BY-SA 2.5 |