Proof systems for Moss' coalgebraic logic

DOI10.1016/j.tcs.2014.06.018zbMath1323.03087OpenAlexW2105634236MaRDI QIDQ402120

Yde Venema, Alessandra Palmigiano, Marta Bílková

Publication date: 27 August 2014

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.018

zbMATH Keywords

modal logiccoalgebracompletenesscoalgebraic logiccover modalityGentzen calculussequent system

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Categorical logic, topoi (03G30) Structure of proofs (03F07)

Related Items (4)

Rough and Near: Modal History of Two Theories ⋮ Unnamed Item ⋮ Coalgebraic logics \& duality ⋮ Lyndon interpolation theorem of instantial neighborhood logic-constructively via a sequent calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cut elimination in coalgebraic logics
• A coalgebraic view on positive modal logic
• Coalgebraic logic
• Universal coalgebra: A theory of systems
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Positive modal logic
• Expressivity of coalgebraic modal logic: the limits and beyond
• Automata and fixed point logic: a coalgebraic perspective
• Normal forms in modal logic
• Admissibility of Cut in Coalgebraic Logics
• Complementation of Coalgebra Automata
• Completeness for the coalgebraic cover modality
• Lax Extensions of Coalgebra Functors
• Automata for the modal μ-calculus and related results
• Coalgebraic Automata Theory: Basic Results
• A final coalgebra theorem
• Computer Science Logic
• Relational algebras
• Foundations of Software Science and Computational Structures
• Generic Modal Cut Elimination Applied to Conditional Logics

This page was built for publication: Proof systems for Moss' coalgebraic logic