English
Related papers

Related papers: Coalgebraic Geometric Logic: Basic Theory

200 papers

This book can be seen either as a text on theorem proving that uses techniques from general algebra, or else as a text on general algebra illustrated and made concrete by practical exercises in theorem proving. The book considers several…

Logic in Computer Science · Computer Science 2021-01-19 Joseph A. Goguen

This paper presents State Algebra, a novel framework designed to represent and manipulate propositional logic using algebraic methods. The framework is structured as a hierarchy of three representations: Set, Coordinate, and Row…

Artificial Intelligence · Computer Science 2025-09-15 Dmitry Lesnik , Tobias Schäfer

Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof.…

Logic · Mathematics 2025-06-03 Borja Sierra Miranda , Thomas Studer , Lukas Zenger

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

We define lifting properties for universal algebras, which we study in this general context and then particularize to various such properties in certain classes of algebras. Next we focus on residuated lattices, in which we investigate…

Logic · Mathematics 2016-08-14 Daniela Cheptea , George Georgescu , Claudia Mureşan

This paper introduces context algebras and demonstrates their application to combining logical and vector-based representations of meaning. Other approaches to this problem attempt to reproduce aspects of logical semantics within new…

Computation and Language · Computer Science 2011-11-08 Daoud Clarke

Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…

Logic in Computer Science · Computer Science 2011-06-28 J. A. Bergstra , A. Ponse

As several different formal systems with inequivalent syntax may describe equivalent semantics, it is possible to find `completions' to more expressive syntaxes that are semantically invariant. Doctrine theory, in the sense of Lawvere, is…

Category Theory · Mathematics 2023-04-18 Joshua Wrigley

We furnish any category of a universal (co)homology theory. Universal (co)homologies and universal relative (co)homologies are obtained by showing representability of certain functors and take values in $R$-linear abelian categories of…

Algebraic Geometry · Mathematics 2023-05-10 L. Barbieri-Viale

We introduce the notion of Rota-Baxter coalgebra which can be viewed as the dual notion of Rota-Baxter algebra. We provide some concrete examples and establish various properties of this new object. We also consider comodules over…

Rings and Algebras · Mathematics 2021-10-05 Run-Qiang Jian , Jiao Zhang

We use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoys uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely…

Logic in Computer Science · Computer Science 2015-03-10 Johannes Marti , Fatemeh Seifan , Yde Venema

Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…

Logic in Computer Science · Computer Science 2024-02-14 Marcelo Fiore , Zeinab Galal , Farzad Jafarrahmani

We introduce and study bisimulations for coalgebras on Stone spaces [14]. Our notion of bisimulation is sound and complete for behavioural equivalence, and generalizes Vietoris bisimulations [4]. The main result of our paper is that…

Logic in Computer Science · Computer Science 2018-04-10 Sebastian Enqvist , Sumit Sourabh

Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…

Category Theory · Mathematics 2019-03-19 Soichiro Fujii

In this paper, we use a categorical and functorial set up to model the syntax and inference of logics with algebraic signature, extending previous works on algebraisation of logics. The main feature of this work is that structurality, or…

Category Theory · Mathematics 2021-09-22 Lingyuan Ye

This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue…

Logic in Computer Science · Computer Science 2018-12-03 Ioana Leustean , Natalia Moanga , Traian Florin Serbanuta

We develop a framework for epistemic logic that combines relevant modal logic with classical propositional logic. In our framework the agent is modeled as reasoning in accordance with a relevant modal logic while the propositional fragment…

Logic in Computer Science · Computer Science 2022-06-08 Igor Sedlár , Pietro Vigiani

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

This monograph is a study of the category of polynomial endofunctors on the category of sets and its applications to modeling interaction protocols and dynamical systems. We assume basic categorical background and build the categorical…

Category Theory · Mathematics 2024-08-20 Nelson Niu , David I. Spivak

Let K be a comonad on a model category M. We provide conditions under which the associated category of K-coalgebras admits a model category structure such that the forgetful functor to M creates both cofibrations and weak equivalences. We…

Algebraic Topology · Mathematics 2014-02-26 Kathryn Hess , Brooke Shipley