Result: The least fibred lifting and the expressivity of coalgebraic modal logic

Title:
The least fibred lifting and the expressivity of coalgebraic modal logic
Authors:
KLIN, Bartek
Source:
Algebra and coalgebra in computer science (Swansea, 3-6 September 2005)Lecture notes in computer science. :247-262
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Algèbre Boole, Boolean algebra, Algebra Boole, Algèbre processus, Process algebra, Algebra proceso, Coalgèbre, Coalgebra, Logique modale, Modal logic, Lógica modal, Préservation, Preservation, Preservación, Relation équivalence, Equivalence relation, Relación equivalencia
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Sussex, United Kingdom
Warsaw University, Poland
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17116006
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17116006
Database:
PASCAL Archive

Further Information

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 paper, the least (fibre-wise) of such liftings, L(B), is characterized for essentially any B. The lifting has all the useful properties of the relation lifting due to Jacobs, without the usual assumption of weak pullback preservation; if B preserves weak pullbacks, the two liftings coincide. Equivalence relations can be viewed as Boolean algebras of subsets (predicates, tests). This correspondence relates L(B) to the least test suite lifting T(B), which is defined in the spirit of predicate lifting as used in coalgebraic modal logic. Properties of T(B) translate to a general expressivity result for a modal logic for 5-coalgebras. In the resulting logic, modal operators of any arity can appear.