Results 1  10
of
249
Coalgebraic Logic
 Annals of Pure and Applied Logic
, 1999
"... We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that infinitary modal logic contains characterizing formulas. That is, every modelworld pair is characterized up to bisimulation by an infinitary formula. The ..."
Abstract

Cited by 110 (0 self)
 Add to MetaCart
We present a generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets. The leading idea is that infinitary modal logic contains characterizing formulas. That is, every modelworld pair is characterized up to bisimulation by an infinitary formula
Expressiveness of Positive Coalgebraic Logic
"... From the point of view of modal logic, coalgebraic logic over posets is the natural coalgebraic generalisation of positive modal logic. From the point of view of coalgebra, posets arise if one is interested in simulations as opposed to bisimulations. From a categorical point of view, one moves from ..."
Abstract
 Add to MetaCart
From the point of view of modal logic, coalgebraic logic over posets is the natural coalgebraic generalisation of positive modal logic. From the point of view of coalgebra, posets arise if one is interested in simulations as opposed to bisimulations. From a categorical point of view, one moves from
Equational Coalgebraic Logic
 MFPS
, 2009
"... Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible onestep behaviours of the system. A fundamental question in this area is how to obtain, for an arbitrary functor T, a logic for Tcoalgebras. We compare two existing proposals, ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible onestep behaviours of the system. A fundamental question in this area is how to obtain, for an arbitrary functor T, a logic for Tcoalgebras. We compare two existing proposals
On the Fusion of coalgebraic logics
"... Abstract. Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to transfer from the component logics to their fusion. In this paper we investigate to what extent these results can b ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
be generalised to the case of arbitrary coalgebraic logics. Our main result generalises a construction of Kracht and Wolter and confirms that completeness transfers to fusion for a large class of logics over coalgebraic semantics. This result is independent of the rank of the logics and relies on generalising
Positive Fragments of Coalgebraic Logics
"... Abstract. Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
to fixedpoint logics, it is noteworthy that the positive coalgebraic logic of a functor is given not by all predicateliftings but by all monotone predicate liftings.
Admissibility of Cut in Coalgebraic Logics
 CMCS
, 2008
"... We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of the (already known) interpolation property for coalition logic and establish the interpolation property for the conditional ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of the (already known) interpolation property for coalition logic and establish the interpolation property
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 axiomatisation of a particular logic and its coalgebraic semantics that guarantee that the cutrule is admissible in the ensuing s ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomatisation of a particular logic and its coalgebraic semantics that guarantee that the cutrule is admissible in the ensuing
MFPS 2009 Equational Coalgebraic Logic
"... Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible onestep behaviors of the system. A fundamental question in this area is how to obtain, for an arbitrary functor T, a logic for Tcoalgebras. We compare two existing proposals, ..."
Abstract
 Add to MetaCart
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible onestep behaviors of the system. A fundamental question in this area is how to obtain, for an arbitrary functor T, a logic for Tcoalgebras. We compare two existing proposals
Results 1  10
of
249