Cut Elimination for Shallow Modal Logics

DOI10.1007/978-3-642-22119-4_17zbMath1244.68069OpenAlexW108950962MaRDI QIDQ3010370

Björn Lellmann, Dirk Pattinson

Publication date: 1 July 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22119-4_17

zbMATH Keywords

modal logicconditional logics

Mathematics Subject Classification ID

Related Items (5)

From input/output logics to conditional logics via sequents -- with provers ⋮ Sequent Systems for Lewis’ Conditional Logics ⋮ Taming Paraconsistent (and Other) Logics ⋮ BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS ⋮ The bounded proof property via step algebras and step frames

Cites Work

• Decidable and undecidable logics with a binary modality
• Sufficient conditions for cut elimination with complexity analysis
• PSPACE bounds for rank-1 modal logics
• A sequent calculus and a theorem prover for standard conditional logics
• Towards an algorithmic construction of cut-elimination procedures
• Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics
• Generic Modal Cut Elimination Applied to Conditional Logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cut Elimination for Shallow Modal Logics