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

DOI10.1016/J.IC.2009.01.007MaRDI QIDQ964500zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

sequent calculuspropositional logiccombinatorial proofskew fibrationproof homomorphism

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

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

Cites work

• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 4055576 (Why is no real title available?)
• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• scientific article; zbMATH DE number 1493054 (Why is no real title available?)
• scientific article; zbMATH DE number 3333259 (Why is no real title available?)
• A Characterization of Medial as Rewriting Rule
• A Linear Recognition Algorithm for Cographs
• A system of interaction and structure
• Handsome proof-nets: Perfect matchings and cographs
• Interpolants, cut elimination and flow graphs for the propositional calculus
• Proofs without syntax
• The cost of a cycle is a square
• The undecidability of k-provability
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• Typed Lambda Calculi and Applications

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
• On combinatorial proofs for modal logic
• Combinatorial flows as bicolored atomic flows

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)