User loginNavigation |
Cyclic Proofs for First-Order Logic with Inductive DefinitionsCyclic Proofs for First-Order Logic with Inductive Definitions, James Brotherston, in Proceedings of TABLEAUX 2005
This technique of making potentially cyclic proof-graphs is really nice since it makes the connection between recursive definitions in a functional programming language and a proof structure very obvious. There is no need to specify the inductive principle ahead of time, you can simply structure the proof tree as you would your functional code. By Gavin Mendel-Gleason at 2008-01-28 20:33 | LtU Forum | previous forum topic | next forum topic | other blogs | 4458 reads
|
Browse archives
Active forum topics
|
Recent comments
16 weeks 2 days ago
20 weeks 4 days ago
22 weeks 1 day ago
22 weeks 1 day ago
24 weeks 6 days ago
29 weeks 3 days ago
29 weeks 3 days ago
29 weeks 6 days ago
29 weeks 6 days ago
32 weeks 5 days ago