Timeline for Pseudo-decision procedures for first order arithmetic
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 22, 2015 at 3:31 | answer | added | user44143 | timeline score: 2 | |
| Jun 22, 2015 at 2:10 | comment | added | Joel David Hamkins | For any theory in which one believes, say, ZFC plus large cardinals or whatever, then one can search for short proofs of arithmetic statements, saying "true" only when such is found; and saying "false" if a proof of the negation is found or if one has exceeded a fixed time bound. This algorithm does not depend on the quantifier complexity of the given statement, but only on the length of the proof and whether it is shorter than the pre-fixed bound. | |
| Jun 22, 2015 at 0:01 | answer | added | Noah Schweber | timeline score: 4 | |
| Jun 21, 2015 at 23:24 | comment | added | Gerry Myerson | Then perhaps, Roger, the onus is on you to do a better job of explaining your question. | |
| Jun 21, 2015 at 23:18 | comment | added | Roger Platt | I don't think you have understood my question. | |
| Jun 21, 2015 at 23:03 | comment | added | The Masked Avenger | Unfortunately, I know a real efficient constant time such algorithm. The problem is to find one that does something adequately useful. It is also unclear how far "adequate" can be realized. | |
| Jun 21, 2015 at 22:33 | review | First posts | |||
| Jun 21, 2015 at 22:36 | |||||
| Jun 21, 2015 at 22:22 | history | asked | Roger Platt | CC BY-SA 3.0 |