Combinatorial proofs for constructive modal logic

MaRDI QIDQ5884933zbMATH OpenFDO

Authors Matteo Acclavio, Lutz Straßburger

Publication date 24 March 2023

zbMATH Keywords

arena netscombinatorial proofsconstructive modal logicproof equivalence

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Proof theory in general (including proof-theoretic semantics) (03F03)

Recommendations

• On combinatorial proofs for modal logic
• From syntactic proofs to combinatorial proofs
• On combinatorial proofs for logics of relevance and entailment
• Proofs without syntax
• Combinatorial proofs and decomposition theorems for first-order logic

Cited in

(12)

• Combination of convex theories: modularity, deduction completeness, and explanation
• A simple combinatorial proof for the small model property of two-variable logic
• On combinatorial proofs for logics of relevance and entailment
• A Constructive Proof of Dependent Choice, Compatible with Classical Logic
• Proof Theory for Casari's Comparative Logics
• Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
• Combinatorial flows as bicolored atomic flows
• Canonicity of proofs in constructive modal logic
• Combinatorial proofs and decomposition theorems for first-order logic
• Intuitionistic proofs without syntax
• Logic programming with multiplicative structures
• A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs

This page was built for publication: Combinatorial proofs for constructive modal logic

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