Skip to main content

Timeline for Writing "Semi-Formal" Proofs

Current License: CC BY-SA 2.5

9 events
when toggle format what by license comment
Nov 5, 2017 at 13:41 comment added Joel David Hamkins Yes, this post was from some time ago, and unfortunately it seems that the system may no longer be available.
Nov 5, 2017 at 13:39 comment added user57432 No links except the first two works.
Feb 16, 2011 at 17:21 comment added Sam Nead @Thierry, jc -- unless I misunderstand, this is not a long way away from a formal language. It is instead, an interpreter away from a formal language. And that interpreter has been written. So the combination is a precise answer to the original question.
Feb 15, 2011 at 22:55 vote accept user2377
Feb 15, 2011 at 22:55 comment added user2377 @Joel At first glance, this does not look like what I was hoping for. However, it does look like it is the closest thing to what I described that exists. It seems to me that it would be fairly straight forward to extend the parser to work with "pure symbols", although I don’t think that's what the authors have in mind when they say "controlled natural language." Thank you for taking the time to write up your response, I am marking it as the answer since it seems likely that this system is as close to what I am looking for as I am going to get. Thanks again, --jc
Feb 15, 2011 at 20:40 comment added Thierry Zell Fascinating. An obvious point that I would like to belabor, though, is that this seems a long way away from the transcription into pure symbols that was mentioned in the original question.
Feb 15, 2011 at 16:16 comment added Joel David Hamkins In Bonn, they have used Naproche in this way. I've heard that they have some computer labs sometimes full of students writing out semi-formal proofs into the system.
Feb 15, 2011 at 16:11 comment added Michael Hardy Interesting. Has anyone tried using proof-checking software in teaching course on how to write proofs?
Feb 15, 2011 at 15:38 history answered Joel David Hamkins CC BY-SA 2.5