Sciweavers

17 search results - page 2 / 4
» Coalgebraic Modal Logic Beyond Sets
Sort
View
ENTCS
2006
130views more  ENTCS 2006»
13 years 4 months ago
Modularity in Coalgebra
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
Corina Cîrstea
IANDC
2010
119views more  IANDC 2010»
13 years 3 months ago
Cut elimination in coalgebraic logics
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
Dirk Pattinson, Lutz Schröder
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
13 years 11 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
ICALP
2010
Springer
13 years 9 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
13 years 10 months ago
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
Bartek Klin