Weak Completeness of Coalgebraic Dynamic Logics
نویسندگان
چکیده
منابع مشابه
Weak Completeness of Coalgebraic Dynamic Logics
We present a coalgebraic generalisation of Fischer and Ladner’s Propositional Dynamic Logic (PDL) and Parikh’s Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a monad T , and modalities are interpreted via a predicate lifting λ whose transpose is a monad morp...
متن کاملStrong Completeness for Iteration-Free Coalgebraic Dynamic Logics
We present a (co)algebraic treatment of iteration-free dynamic modal logics such as Propositional Dynamic Logic (PDL) and Game Logic (GL), both without star. The main observation is that the program/game constructs of PDL/GL arise from monad structure, and the axioms of these logics correspond to certain compatibilty requirements between the modalities and this monad structure. Our main contrib...
متن کاملStrong Completeness of Coalgebraic Modal Logics
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics often present subtle difficulties – up to the point that canonical models may fail to exist, as is the case e.g. in most probabilistic logics. Here, we present a...
متن کاملSome Sahlqvist Completeness Results for Coalgebraic Logics
This paper presents a first step towards completeness-viacanonicity results for coalgebraic modal logics. Specifically, we consider the relationship between classes of coalgebras for ω-accessible endofunctors and logics defined by Sahlqvist-like frame conditions. Our strategy is based on conjoining two well-known approaches: we represent accessible functors as (equational) quotients of polynomi...
متن کاملCompleteness-via-canonicity for coalgebraic logics
This thesis aims to provide a suite of techniques to generate completeness results for coalgebraic logics with axioms of arbitrary rank. We have chosen to investigate the possibility to generalize what is arguably one of the most successful methods to prove completeness results in ‘classical’ modal logic, namely completeness-via-canonicity. This technique is particularly well-suited to a coalge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.191.9