Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ENTCS
2007

favoriteEmaildiscussreport

151views more ENTCS 2007»

Coalgebraic Modal Logic Beyond Sets

13 years 4 months ago

Coalgebraic Modal Logic Beyond Sets

Download www.mimuw.edu.pl

Polyadic coalgebraic modal logic is studied in the setting of locally presentable categories. It is shown that under certain assumptions, accessible functors admit expressive logics for their coalgebras. Examples include typical functors used to describe systems with name binding, interpreted in nominal sets.

Bartek Klin

Real-time Traffic

Accessible Functors | Certain Assumptions | Coalgebraic Modal Logic | ENTCS 2007 |

claim paper

Related Content

» Expressivity of Coalgebraic Modal Logic The Limits and Beyond

» Beyond Rank 1 Algebraic Semantics and Finite Models for Coalgebraic Logics

» An institution of modal logics for coalgebras

» Modal Predicates and Coequations

» Modularity in Coalgebra

» Cut elimination in coalgebraic logics

» Optimal Tableau Algorithms for Coalgebraic Logics

» Automata for Coalgebras An Approach Using Predicate Liftings

» The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ENTCS
Authors	Bartek Klin

Comments (0)