A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs

DOI10.1016/J.IC.2009.01.007zbMATH Open1200.68218DBLPjournals/iandc/Carbone10OpenAlexW2071146589WikidataQ57253048 ScholiaQ57253048MaRDI QIDQ964500FDOQ964500

Authors: Alessandra Carbone 

Publication date: 22 April 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.01.007

Recommendations

• A new graphical calculus of proofs
• A graph-theoretic approach to sequent derivability in the Lambek calculus
• From syntactic proofs to combinatorial proofs
• A formal framework for specifying sequent calculus proof systems
• Propositional intuitionistic multiple-conclusion calculus via proof graphs
• Towards a combinatorial proof theory
• Generic methods for formalising sequent calculi applied to provability logic
• From input/output logics to conditional logics via sequents -- with provers
• Combinatorial proofs for constructive modal logic
• A sequent calculus and a theorem prover for standard conditional logics

zbMATH Keywords

sequent calculuspropositional logiccombinatorial proofskew fibrationproof homomorphism

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Linear Recognition Algorithm for Cographs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A system of interaction and structure
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• Proofs without syntax
• Typed Lambda Calculi and Applications
• The undecidability of \(k\)-provability
• The cost of a cycle is a square
• Interpolants, cut elimination and flow graphs for the propositional calculus
• Title not available (Why is that?)
• A Characterization of Medial as Rewriting Rule
• Handsome proof-nets: Perfect matchings and cographs

Cited In (7)

• Proofs without syntax
• On graph calculi for multi-modal logics
• From syntactic proofs to combinatorial proofs
• Towards a combinatorial proof theory
• On a graph calculus for modalities
• Combinatorial flows as bicolored atomic flows
• On combinatorial proofs for modal logic

This page was built for publication: A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964500)