English
Related papers

Related papers: Positive fragments of coalgebraic logics

200 papers

This article contributes in that it clarifies and indeed completes an approach (initiated by Dunn and this author several years ago and again pursued by the present author over the last three years or so) to the relational semantics of…

Logic · Mathematics 2024-12-22 Chrysafis Hartonas

We develop the theory of recollements in a stable $\infty$-categorical setting. In the axiomatization of Beilinson, Bernstein and Deligne, recollement situations provide a generalization of Grothendieck's "six functors" between derived…

Category Theory · Mathematics 2016-05-27 Domenico Fiorenza , Fosco Loregian

The main observation of this paper is that some sequential weak compactness arguments in Hilbert space theory can be replaced by Heine/Borel compactness arguments (for the strong topology). Even though the latter form of compactness fails…

Logic · Mathematics 2019-07-29 Fernando Ferreira , Laurentiu Leustean , Pedro Pinto

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripke-style semantic founded…

Quantum Physics · Physics 2009-12-22 G. Domenech , H. Freytes , C. de Ronde

The fundamental construction underlying descent theory, the lax descent category, comes with a functor that forgets the descent data. We prove that, in any $2$-category $\mathfrak{A} $ with lax descent objects, the forgetful morphisms…

Category Theory · Mathematics 2021-05-21 Fernando Lucatelli Nunes

On relational structures and on polymodal logics, we describe operations which preserve local tabularity. This provides new sufficient semantic and axiomatic conditions for local tabularity of a modal logic. The main results are the…

Logic · Mathematics 2025-07-16 Ilya B. Shapirovsky

The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

Motivated by applications in modelling quantum systems using coalgebraic techniques, we introduce a fibred coalgebraic logic. Our approach extends the conventional predicate lifting semantics with additional modalities relating conditions…

Quantum Physics · Physics 2014-12-31 Daniel Marsden

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

Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type. However, popular…

Logic in Computer Science · Computer Science 2016-06-10 Lutz Schröder , Yde Venema

We define a framework for incorporating alternation-free fixpoint logics into the dual-adjunction setup for coalgebraic modal logics. We achieve this by using order-enriched categories. We give a least-solution semantics as well as an…

Logic in Computer Science · Computer Science 2024-05-02 Ezra Schoen , Clemens Kupke , Jurriaan Rot , Ruben Turkenburg

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

We present a survey of the two-dimensional and tensorial structure of the lifting doctrine in constructive domain theory, i.e. in the theory of directed-complete partial orders (dcpos) over an arbitrary elementary topos. We establish the…

Category Theory · Mathematics 2025-01-31 Jonathan Sterling

In this paper we introduce and study a categorical action of the positive part of the Heisenberg Lie algebra on categories of modules over rational Cherednik algebras associated to symmetric groups. We show that the generating functor for…

Representation Theory · Mathematics 2024-08-06 Roman Bezrukavnikov , Ivan Losev

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

Any refinement system (= functor) has a fully faithful representation in the refinement system of presheaves, by interpreting types as relative slice categories, and refinement types as presheaves over those categories. Motivated by an…

Logic in Computer Science · Computer Science 2015-08-04 Paul-André Melliès , Noam Zeilberger

A general theorem due to Howe of dual action of a classical group and a certain non-associative algebra on a space of symmetric or alternating tensors is reformulated in a setting of second quantization, and familiar examples in atomic and…

Mathematical Physics · Physics 2020-12-29 K. Neergård

A differential modality is a comonad on an additive symmetric monoidal category $(\mathsf{C},\otimes,I)$, whose underlying functor we denote $!\colon\mathsf{C} \rightarrow \mathsf{C}$, together with some additional structure including a…

Category Theory · Mathematics 2026-04-20 Jean-Baptiste Vienney

Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…

Logic in Computer Science · Computer Science 2014-04-15 Fabio Mogavero , Giuseppe Perelli