English
Related papers

Related papers: Moss' logic for ordered coalgebras

200 papers

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical…

Logic in Computer Science · Computer Science 2015-07-01 Clemens Kupke , Alexander Kurz , Yde Venema

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Logic · Mathematics 2023-06-22 Nick Bezhanishvili , Jim de Groot , Yde Venema

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

We address the task of deriving fixpoint equations from modal logics characterizing behavioural equivalences and metrics (summarized under the term conformances). We rely on earlier work that obtains Hennessy-Milner theorems as corollaries…

Logic in Computer Science · Computer Science 2024-02-01 Harsh Beohar , Sebastian Gurke , Barbara König , Karla Messing , Jonas Forster , Lutz Schröder , Paul Wild

The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…

Commutative Algebra · Mathematics 2020-08-13 Ezra Miller

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

Logic in Computer Science · Computer Science 2020-05-13 Vincenzo Ciancia , Diego Latella , Mieke Massink , Erik de Vink

We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the…

Logic in Computer Science · Computer Science 2015-07-01 Marta Bilkova , Alexander Kurz , Daniela Petrisan , Jiri Velebil

We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…

Logic in Computer Science · Computer Science 2020-08-24 Jim de Groot , Helle Hvid Hansen , Alexander Kurz

Homological algebra of modules over posets is developed, as closely parallel as possible to that of finitely generated modules over noetherian commutative rings, in the direction of finite presentations and resolutions. Centrally at issue…

Algebraic Topology · Mathematics 2020-08-12 Ezra Miller

We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. By formalizing the problem in the language of coalgebraic…

Logic in Computer Science · Computer Science 2016-02-03 Fredrik Dahlqvist , David Pym

We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring…

Category Theory · Mathematics 2009-06-01 Panagis Karazeris , Apostolos Matzaris , Jiri Velebil

We prove that every finitary polynomial endofunctor of a category $C$ has a final coalgebra if $C$ is locally Cartesian closed, has finite disjoint coproducts and a natural number object. More generally, we prove that the category of…

Category Theory · Mathematics 2007-05-23 Luigi Santocanale

This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modelled as coalgebras with a finitely generated carrier for an endofunctor on a locally…

Logic in Computer Science · Computer Science 2019-09-09 Stefan Milius , Dirk Pattinson , Thorsten Wißmann

We study coalgebraic modal logic to characterise behavioural equivalence in the presence of side effects, i.e., when coalgebras live in a (co)Kleisli or an Eilenberg-Moore category. Our aim is to develop a general framework based on indexed…

Logic in Computer Science · Computer Science 2022-02-07 H. Beohar , B. König , S. Küpper , C. Mika-Michalski

We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type…

Logic in Computer Science · Computer Science 2018-05-21 Ulrich Dorsch , Stefan Milius , Lutz Schröder , Thorsten Wißmann

It is well known that classical varieties of $\Sigma$-algebras correspond bijectively to finitary monads on $\mathsf{Set}$. We present an analogous result for varieties of ordered $\Sigma$-algebras, i.e., classes presented by inequations…

Category Theory · Mathematics 2021-01-07 J. Adámek , M. Dostál , J. Velebil

This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modeled as coalgebras with a finitely generated carrier for an endofunctor on a locally…

Category Theory · Mathematics 2017-10-23 Stefan Milius , Dirk Pattinson , Thorsten Wißmann

In this paper, we present an abstract framework of many-valued modal logic with the interpretation of atomic propositions and modal operators as predicate lifting over coalgebras for an endofunctor on the category of sets. It generalizes…

Logic in Computer Science · Computer Science 2022-10-25 Chun-Yu Lin , Churn-Jung Liau

The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general…

Logic in Computer Science · Computer Science 2023-06-22 Clemens Kupke , Jurriaan Rot

The aim of the paper is to study the topological modal logic of $T_0$ spaces, with the difference modality (for $T_n$, where $n\geq1 $ the corresponding logics were known). We consider propositional modal logic with two modal operators…

Logic · Mathematics 2019-12-03 Rajab Aghamov
‹ Prev 1 2 3 10 Next ›