Generic Modal Cut Elimination Applied to Conditional Logics

DOI10.1007/978-3-642-02716-1_21MaRDI QIDQ5902296zbMATH OpenOpenAlexFDO

Authors Dirk Pattinson, Lutz Schröder

Publication date 1 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1011.3479

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05)

Abstract: We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide variety of logics outside the realm of normal modal logic. We give extensive example instantiations of our framework to various conditional logics. For these, we obtain fully internalised calculi which are substantially simpler than those known in the literature, along with leaner proofs of cut elimination and complexity. In one case, conditional logic with modus ponens and conditional excluded middle, cut elimination and complexity were explicitly stated as open in the literature.

Recommendations

• Generic modal cut elimination applied to conditional logics
• Cut elimination for shallow modal logics
• Cut-elimination for quantified conditional logic
• Cut elimination in nested sequents for intuitionistic modal logics
• Semantical approach to cut elimination and subformula property in modal logic
• The modal logic of provability: cut-elimination
• Modal Sequent Calculi Labelled with Truth Values: Cut Elimination
• Conditionals and modularity in general logics
• Cut-elimination theorems for some infinitary modal logics
• A short and readable proof of cut elimination for two first-order modal logics

Cited in

(16)

• Cut-elimination for quantified conditional logic
• Non-normal modal logics and conditional logics: semantic analysis and proof theory
• Constructing cut free sequent systems with context restrictions based on classical or intuitionistic logic
• Simple cut elimination proof for hybrid logic
• Cut elimination for shallow modal logics
• Admissibility of cut in congruent modal logics
• scientific article; zbMATH DE number 67452 (Why is no real title available?)
• Proof systems for Moss' coalgebraic logic
• Cut Might Cautiously
• Modular Cut-Elimination: Finding Proofs or Counterexamples
• Modal Sequent Calculi Labelled with Truth Values: Cut Elimination
• Generic modal cut elimination applied to conditional logics
• Cut elimination in coalgebraic logics
• Hybrid logic with the difference modality for generalisations of graphs
• From modal sequent calculi to modal resolution
• Non-iterative modal resolution calculi

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

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