Strong completeness of coalgebraic modal logics

DOI10.4230/LIPICS.STACS.2009.1855MaRDI QIDQ5390017zbMATH OpenOpenAlexFDO

Authors Lutz Schröder, Dirk Pattinson

Publication date 24 April 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_b5a4.html

zbMATH Keywords

coalgebradeductionlogic in computer sciencemodal logicsemantics

Mathematics Subject Classification ID

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

Recommendations

• Rank-1 modal logics are coalgebraic
• A finite model construction for coalgebraic modal logic
• Foundations of Software Science and Computation Structures
• Some Sahlqvist Completeness Results for Coalgebraic Logics
• Completeness via canonicity for distributive substructural logics: a coalgebraic perspective

Cited in

(13)

• Trust evidence logic
• A note on the issue of cohesiveness in canonical models
• Coalgebraic completeness-via-canonicity for distributive substructural logics
• Completeness for the coalgebraic cover modality
• Named models in coalgebraic hybrid logic
• Completeness via canonicity for distributive substructural logics: a coalgebraic perspective
• Strong Completeness of a Pure Free Logic
• Some Sahlqvist Completeness Results for Coalgebraic Logics
• Weak completeness of coalgebraic dynamic logics
• Non-iterative modal logics are coalgebraic
• Coalgebraic Completeness-via-Canonicity
• Game-based local model checking for the coalgebraic \(\mu\)-calculus
• Many-valued coalgebraic modal logic: one-step completeness and finite model property

This page was built for publication: Strong completeness of coalgebraic modal logics

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