English
Related papers

Related papers: Coalgebraic Geometric Logic: Basic Theory

200 papers

The paper aims to develop a framework for coalgebraic fuzzy geometric logic by adding modalities to the language of fuzzy geometric logic. Using the methods of coalgebra, the modal operators are introduced in the language of fuzzy geometric…

Logic in Computer Science · Computer Science 2022-09-08 Litan Kumar Das , Kumar Sankar Ray , Prakash Chandra Mali

We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal…

Logic in Computer Science · Computer Science 2024-08-07 Alexander Kurz , Wolfgang Poiger , Bruno Teheux

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

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 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

This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…

Logic in Computer Science · Computer Science 2020-02-18 Jiří Adámek , Stefan Milius , Lawrence S. Moss

We present a finitary version of Moss' coalgebraic logic for $T$-coalgebras, where $T$ is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least…

Logic in Computer Science · Computer Science 2023-06-22 Marta Bílková , Matěj Dostál

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

Combinatorics · Mathematics 2022-10-07 MLE Slone

We present positive coalgebraic logic in full generality, and show how to obtain a positive coalgebraic logic from a boolean one. On the model side this involves canonically computing an endofunctor $T': Pos\to Pos$ from an endofunctor $T:…

Logic in Computer Science · Computer Science 2018-12-19 Fredrik Dahlqvist , Alexander Kurz

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

Every endofunctor of the category of classes is proved to be set-based in the sense of Aczel and Mendler, therefore, it has a final coalgebra. Other basic properties of these endofunctors are proved, e.g. the existence of a free completely…

Logic in Computer Science · Computer Science 2007-05-23 J. Adamek , S. Milius , J. Velebil

We develop a uniform coalgebraic approach to J\'onsson-Tarski and Thomason type dualities for various classes of neighborhood frames and neighborhood algebras. In the first part of the paper we construct an endofunctor on the category of…

Logic in Computer Science · Computer Science 2023-06-22 Guram Bezhanishvili , Nick Bezhanishvili , Jim de Groot

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…

Logic · Mathematics 2017-01-05 Daniel Murfet

In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…

Logic in Computer Science · Computer Science 2024-04-02 Andrés Gallardo , Ignacio Viglizzo

We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses the coinductive models and, hence, the results apply to a wide class of modal logics including, for example,…

Logic in Computer Science · Computer Science 2013-04-01 Carlos Areces , Guillaume Hoffmann , Ezequiel Orbe

The theory of coalgebras, for an endofunctor on a category, has been proposed as a general theory of transition systems. We investigate and relate four generalizations of bisimulation to this setting, providing conditions under which the…

Logic in Computer Science · Computer Science 2015-07-01 Sam Staton

Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…

Logic in Computer Science · Computer Science 2013-01-07 Zhaohua Luo

We investigate the possibility of deriving metric trace semantics in a coalgebraic framework. First, we generalize a technique for systematically lifting functors from the category Set of sets to the category PMet of pseudometric spaces,…

Logic in Computer Science · Computer Science 2015-06-01 Paolo Baldan , Filippo Bonchi , Henning Kerstan , Barbara König

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

We give a new coalgebraic semantics for intuitionistic modal logic with $\Box$. In particular, we provide a colagebraic representation of intuitionistic descriptive modal frames and of intuitonistic modal Kripke frames based on image-finite…

Logic · Mathematics 2024-06-18 Rodrigo Nicolau Almeida , Nick Bezhanishvili
‹ Prev 1 2 3 10 Next ›