One of the more common ways to do proofs is using a deductive system.
Can proofs instead be done using graphs?
I am seeking papers that outline from the ground up how such a system works. If example code in Prolog is provided even better.
This question originated from using Incredible Proof Machine and looking at the code and reading the paper.
such a graph constitutes a rigorous, formal proof.
While I can Google for words such as "proof", "graph", "deductive system", such results do not outline a path for understanding and building such a system; the results are more like throwing darts and randomly hitting spots on the target.
Before asking this question, this was one of the better papers I found Proofs with graphs. I am hoping for something that is more basic with code examples.
- Deduction Graphs
- Proof Nets
- Natural Deduction
- Lambda Calculus with Let-binding
- Typed Lambda Calculus