Generic Modal Cut Elimination Applied to Conditional Logics

DOI10.2168/LMCS-7(1:4)2011zbMath1232.03049OpenAlexW2950911791MaRDI QIDQ5892512

Lutz Schröder, Dirk Pattinson

Publication date: 26 May 2011

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-7(1:4)2011

zbMATH Keywords

modal logiccut eliminationproof theoryconditional logicconditional implication

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (8)

Cut-elimination for quantified conditional logic ⋮ From input/output logics to conditional logics via sequents -- with provers ⋮ A Sequent Calculus for Preferential Conditional Logic Based on Neighbourhood Semantics ⋮ Nested Sequent Calculi for Conditional Logics ⋮ Sequent Systems for Lewis’ Conditional Logics ⋮ Natural deduction calculi and sequent calculi for counterfactual logics ⋮ Unnamed Item ⋮ Standard Sequent Calculi for Lewis’ Logics of Counterfactuals

Uses Software

• CoLoSS

This page was built for publication: Generic Modal Cut Elimination Applied to Conditional Logics