Admissibility of Cut in Coalgebraic Logics

DOI10.1016/j.entcs.2008.05.027zbMath1279.03087MaRDI QIDQ2873670

Lutz Schröder, Dirk Pattinson

Publication date: 24 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.05.027

zbMATH Keywords

modal logic; cut elimination; proof theory; coalgebraic semantics

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03G30: Categorical logic, topoi

03F05: Cut-elimination and normal-form theorems

Related Items

Proof systems for Moss' coalgebraic logic, Hybrid logic with the difference modality for generalisations of graphs, Coalgebraic Hybrid Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal tableau calculi and interpolation
• Amalgamation and interpolation in normal modal logics
• Cut-free sequent and tableau systems for propositional Diodorean modal logics
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Cut-free tableau calculi for some propositional normal modal logics
• A finite model construction for coalgebraic modal logic
• Rank-1 Modal Logics Are Coalgebraic
• A Modal Logic for Coalitional Power in Games
• A sequent calculus and a theorem prover for standard conditional logics
• Foundations of Software Science and Computation Structures