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

DOI10.1016/j.ic.2009.01.007zbMath1200.68218DBLPjournals/iandc/Carbone10OpenAlexW2071146589WikidataQ57253048 ScholiaQ57253048MaRDI QIDQ964500

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

zbMATH Keywords

propositional logicsequent calculuscombinatorial proofskew fibrationproof homomorphism

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (2)

On a graph calculus for modalities ⋮ On graph calculi for multi-modal logics

Cites Work

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

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