Modular construction of complete coalgebraic logics

DOI10.1016/J.TCS.2007.06.002MaRDI QIDQ2464936zbMATH OpenOpenAlexWikidataFDO

Authors Corina Cîrstea, Dirk Pattinson

Publication date 18 December 2007

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

Full work available at URL https://eprints.soton.ac.uk/262612/1/tcs.pdf

zbMATH Keywords

coalgebracompletenessmodal logicprobabilistic systems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Categorical logic, topoi (03G30)

Recommendations

• CONCUR 2004 - Concurrency Theory
• Modularity in coalgebra
• A compositional approach to defining logics for coalgebras
• Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
• Universal coalgebras and their logics

Cites work

• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 2086649 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• A compositional approach to defining logics for coalgebras
• A final coalgebra theorem
• A hierarchy of probabilistic system types
• Algebraic semantics for coalgebraic logics
• Bisimulation for labelled Markov processes
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation through probabilistic testing
• Categorical logic and type theory
• Coalgebraic logic
• Coalgebraic modal logic beyond sets
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Expressive logics for coalgebras via terminal sequence induction
• From modal logic to terminal coalgebras
• Many-sorted coalgebraic modal logic: A model-theoretic study
• On expressivity and compositionality in logics for coalgebras
• On the final sequence of a finitary set functor
• Probabilistic extensions of process algebras.
• Probability logic for type spaces
• Reactive, generative, and stratified models of probabilistic processes
• Results on the propositional \(\mu\)-calculus
• Specifying coalgebras with modal logic
• Universal coalgebra: A theory of systems

Cited in

(23)

• Hybrid logic with the difference modality for generalisations of graphs
• Constructing Fully Complete Models of Multiplicative Linear Logic
• CONCUR 2004 - Concurrency Theory
• Maximal traces and path-based coalgebraic temporal logics
• On a categorical framework for coalgebraic modal logic
• Generic infinite traces and path-based coalgebraic temporal logics
• Presenting functors on many-sorted varieties and applications
• scientific article; zbMATH DE number 7407797 (Why is no real title available?)
• scientific article; zbMATH DE number 5872402 (Why is no real title available?)
• Coalgebraic semantics of modal logics: an overview
• Modular Algorithms for Heterogeneous Modal Logics
• Coalgebraic Completeness-via-Canonicity
• Coalgebraic logics \& duality
• Coalgebraic logic for stochastic right coalgebras
• Modular games for coalgebraic fixed point logics
• Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
• The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games
• Coalgebraic completeness-via-canonicity for distributive substructural logics
• Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
• Generalized product of coalgebraic hybrid logics
• Decidability of modular logics for concurrency
• Modularity in coalgebra
• Completeness for the coalgebraic cover modality

This page was built for publication: Modular construction of complete coalgebraic logics

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