English
Related papers

Related papers: Strongly Complete Logics for Coalgebras

200 papers

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

Logic in Computer Science · Computer Science 2021-07-06 Bharat Adsul , Saptarshi Sarkar , A. V. Sreejith

We introduce normal cores, as well as the more general action cores, in the context of a semi-abelian category, and further generalise those to split extension cores in the context of a homological category. We prove that, if the category…

Category Theory · Mathematics 2023-07-26 D. Bourn , A. S. Cigoli , J. R. A. Gray , T. Van der Linden

In this article, we give a representation of bounded complex linear operators which preserve idempotent elements on the Fourier algebra of a locally compact group. When such an operator is moreover positive or contractive, we show that the…

Functional Analysis · Mathematics 2023-02-03 Ying-Fen Lin , Shiho Oi

A semantic model enjoys full definability if every semantic element in the model is a denotation of some proof or program. Full definability indicates that the model captures programs and proofs in a highly detailed manner. This paper…

Logic in Computer Science · Computer Science 2026-04-30 Takeshi Tsukada , Kazuyuki Asada , Kengo Hirata

We show how the relatively initial or relatively terminal fixed points for a well-behaved functor $F$ form a pair of adjoint functors between $F$-coalgebras and $F$-algebras. We use the language of locally presentable categories to find…

Category Theory · Mathematics 2025-09-03 Ezra Schoen , Jade Master , Clemens Kupke

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas.…

Logic in Computer Science · Computer Science 2019-03-14 Sebastian Enqvist , Fatemeh Seifan , Yde Venema

Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…

Programming Languages · Computer Science 2015-02-05 Mauro Jaskelioff , Russell O'Connor

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt

By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…

Logic in Computer Science · Computer Science 2013-05-28 Murdoch J. Gabbay

The natural problem we approach in the present paper is to show how the notion of formally smooth (co)algebra inside monoidal categories can substitute that of (co)separable (co)algebra in the study of splitting bialgebra homomorphisms.…

Quantum Algebra · Mathematics 2010-08-27 Alessandro Ardizzoni

We present a functorial construction which, starting from a congruence $\alpha$ of finite index in an algebra A, yields a new algebra C with the following properties: the congruence lattice of C is isomorphic to the interval of congruences…

Logic · Mathematics 2021-01-12 Peter Mayr , Agnes Szendrei

We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The…

Category Theory · Mathematics 2007-05-23 Florian Lengyel

Many kinds of categorical structure require the existence of finite limits, of colimits of some specified type, and of "exactness" conditions between the finite limits and the specified colimits. Some examples are the notions of regular, or…

Category Theory · Mathematics 2012-02-20 Richard Garner , Stephen Lack

Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…

Algebraic Topology · Mathematics 2025-05-08 Victor Roca i Lucio

Constructive meaning is given to the assertion that every finite Boolean algebra is an injective object in the category of distributive lattices. To this end, we employ Scott's notion of entailment relation, in which context we describe…

Logic in Computer Science · Computer Science 2023-06-22 Davide Rinaldi , Daniel Wessel

We show that for any separably closed field $k$ of characteristic $p>0$, the canonical functor from nilpotent $p$-adic spaces to $\mathbb{E}_{\infty}$-coalgebras over $k$ (given by singular chains with coefficients in $k$) is fully…

Algebraic Topology · Mathematics 2024-02-27 Tom Bachmann , Robert Burklund

For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…

Rings and Algebras · Mathematics 2017-08-01 Brett McLean

We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…

Category Theory · Mathematics 2020-10-13 Volodymyr Lyubashenko

In this paper, we show that for unital, separable $C^*$-algebras of stable rank one and real rank zero, the unitary Cuntz semigroup functor and the functor ${\rm K}_*$ are naturallly equivalent. Then we introduce a refinement of the unitary…

Operator Algebras · Mathematics 2022-07-26 Qingnan An , Zhichao Liu

We show that constructible models of arbitrary complete continuous first-order theories are unique up to isomorphism.

Logic · Mathematics 2025-01-07 James E. Hanson