{"id":137,"date":"2017-04-12T12:57:18","date_gmt":"2017-04-12T12:57:18","guid":{"rendered":"http:\/\/hilbert.dm.fct.unl.pt\/?page_id=137"},"modified":"2018-01-09T09:56:41","modified_gmt":"2018-01-09T09:56:41","slug":"tutorial-in-combinatorial-proofs","status":"publish","type":"page","link":"https:\/\/hilbert.dm.fct.unl.pt\/?page_id=137","title":{"rendered":"Tutorial in Combinatorial Proofs"},"content":{"rendered":"
In Proofs Without Syntax<\/a> Dominic Hughes introduced combinatorial (graph-theoretical) proofs for classical propositional logic. In Towards Hilbert\u2019s 24th Problem<\/a> Hughes approaches the question of simplicity of proofs with combinatorial proofs as abstract invariants for sequent calculus proofs, analogous to homotopy groups as abstract invariants for topological spaces.<\/div>\n
<\/div>\n

 <\/p>\n

In a continuing series of short papers, we want to provide a small tutorial in combinatorial (graph-theoretical) proofs and explore its use and connections to proof-theoretical questions as the simplicity of proofs.<\/div>\n
<\/div>\n
<\/div>\n
<\/div>\n