Timeline for Are there logical systems where formal proofs are not computer verifiable?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 11, 2018 at 21:43 | answer | added | none | timeline score: 8 | |
| Oct 11, 2018 at 20:10 | vote | accept | Eben Kadile | ||
| Oct 11, 2018 at 16:33 | answer | added | Panu Raatikainen | timeline score: 3 | |
| Oct 11, 2018 at 7:35 | answer | added | Andrej Bauer | timeline score: 18 | |
| Oct 11, 2018 at 7:29 | comment | added | Andrej Bauer | @L.Garde: Well, maybe. | |
| Oct 11, 2018 at 5:09 | comment | added | L. Garde | This post may answer your question: math.andrej.com/2016/08/09/what-is-a-formal-proof | |
| Oct 11, 2018 at 4:56 | comment | added | Eben Kadile | @GerhardPaseman Good question, I'm not sure how such proofs could be considered proofs, which is why I'm so curious about it. Perhaps it's my post that is too philosophical for the forum, but this seemed like the site where it would be the most likely to get an answer. | |
| Oct 11, 2018 at 4:53 | comment | added | Eben Kadile | @Somos I mean theoretical computers. I left the notion of rigor undefined because I'm curious if there are systems which define it in a way that isn't computationally verifiable. | |
| Oct 11, 2018 at 4:20 | comment | added | Gerhard Paseman | If a proof does not have a verification process, what use is the proof? Or are you imagining something that resembles a proof in some ways and not in others? Gerhard "Too Philosophical For This Forum?" Paseman, 2018.10.10. | |
| Oct 11, 2018 at 4:12 | comment | added | Somos | And a "rigorous" proof is what exactly? And by computer you mean physical computers or theoretical computers such as Turing machines? | |
| Oct 11, 2018 at 3:03 | history | asked | Eben Kadile | CC BY-SA 4.0 |