Cut elimination in coalgebraic logics

DOI10.1016/J.IC.2009.11.008zbMath1255.03052OpenAlexW1998546048MaRDI QIDQ618171

Dirk Pattinson, Lutz Schröder

Publication date: 14 January 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.11.008

zbMATH Keywords

coalgebracut eliminationpropositional modal logicconditional logicinterpolation propertycoalgebraic semanticscoalition logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Categorical logic, topoi (03G30) Cut-elimination and normal-form theorems (03F05) Interpolation, preservation, definability (03C40)

Related Items (6)

Hypersequent rules with restricted contexts for propositional modal logics ⋮ Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design ⋮ Proof systems for Moss' coalgebraic logic ⋮ Coalgebraic semantics of modal logics: an overview ⋮ Global Caching for Coalgebraic Description Logics ⋮ Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of philosophical logic. Vol. 8
• Modal tableau calculi and interpolation
• Proof analysis in modal logic
• Towards a semantic characterization of cut-elimination
• 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
• Sufficient conditions for cut elimination with complexity analysis
• Cut-free tableau calculi for some propositional normal modal logics
• A finite model construction for coalgebraic modal logic
• PSPACE bounds for rank-1 modal logics
• 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
• Generic Modal Cut Elimination Applied to Conditional Logics
• Specifying coalgebras with modal logic

This page was built for publication: Cut elimination in coalgebraic logics