![]() This sequel approaches Hilbert's 24th Problem with combinatorial proofs as abstract invariants for sequent calculus proofs, analogous to homotopy groups as abstract invariants for topological spaces. ![]() Proofs Without Syntax introduced polynomial-time checkable combinatorial proofs for classical proposi-tional logic. Towards Hilbert's 24th Problem: Combinatorial Proof Invariants Sequent calculus fails to be surjective onto combinatorial proofs: the paper extracts a semantically motivated closure of sequent calculus from which there is a surjection, pointing towards an abstract combinatorial refinement of Herbrand's theorem.Įlectronic Notes in Theoretical Computer Science 165 (2006) 37-63 The paper lifts a simple, strongly normalising cut elimination from combinatorial proofs to sequent calculus, factorising away the mechanical commutations of structural rules which litter traditional syntactic cut elimination. ![]() Problem with combinatorial proofs as abstract invariants for sequent calculus proofs, analogous to homotopy groups as abstract invariants for topological spaces. Proofs Without Syntax ] introduced polynomial-time checkable combinatorial proofs for classical propositional logic. Abstract of research paper on Computer and information sciences, author of scientific article - Dominic J.D.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |