English
Related papers

Related papers: Generalized existential completions and their regu…

200 papers

We investigate completeness and parametricity for a general class of realizability semantics for System F defined in terms of closure operators over sets of $\lambda$-terms. This class includes most semantics used for normalization…

Logic in Computer Science · Computer Science 2023-06-22 Paolo Pistone

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…

Logic · Mathematics 2012-10-30 Cameron Donnay Hill

For a certain class of abelian categories, we show how to make sense of the "Euler characteristic" of an infinite projective resolution (or, more generally, certain chain complexes that are only bounded above), by passing to a suitable…

Category Theory · Mathematics 2014-02-26 Pramod N. Achar , Catharina Stroppel

Rule-based languages lie at the core of several areas of central importance to databases and artificial intelligence such as deductive databases and knowledge representation and reasoning. Disjunctive existential rules (a.k.a. disjunctive…

Logic in Computer Science · Computer Science 2025-08-19 Marco Calautti , Marco Console , Andreas Pieris

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, we study a class of toposes with enough points, the $\kappa$-separable toposes. These are equivalent to sheaf toposes over a site with $\kappa$-small limits that has at…

Logic · Mathematics 2017-09-08 Christian Espíndola

Let $\mathcal{X}$ be a resolving and contravariantly finite subcategory of $\rm{mod}\mbox{-}\Lambda$, the category of finitely generated right $\Lambda$-modules. We associate to $\mathcal{X}$ the subcategory…

Representation Theory · Mathematics 2019-10-10 Rasool Hafezi , Intan Muchtadi-Alamsyah

It is shown that universal algebras that are injective in their equational classes are characterized by internal property that can be called completeness. We define universal algebra $A$ as complete (closed to simple extensions) if for each…

Commutative Algebra · Mathematics 2021-12-14 Pavlo Dzikovskyi

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

This article is an introduction to the basic generalized category theory used in recent work on an extension of the theory of categories and categorical logic, including parts of topos theory. We discuss functors, equivalences, natural…

Category Theory · Mathematics 2017-12-27 Lucius T. Schoenbaum

An algebraically exact category in one that admits all of the limits and colimits which every variety of algebras possesses and every forgetful functor between varieties preserves, and which verifies the same interactions between these…

Category Theory · Mathematics 2011-09-02 Richard Garner

We introduce a general categorical framework for finiteness conditions that unifies classical notions such as Noetherianness, Artinianness, and various forms of topological compactness. This is achieved through the concept of…

Category Theory · Mathematics 2025-09-15 David Forsman

This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…

Category Theory · Mathematics 2026-03-02 Ismael Gutierrez Garcia , Luz Adriana Mejía Castaño

Let $\hat{R}$ be the $I$-adic completion of a commutative ring $R$ with respect to a finitely generated ideal $I$. We give a necessary and sufficient criterion for the category of perfect complexes over $\hat{R}$ to be equivalent to the…

Commutative Algebra · Mathematics 2024-11-25 Paul Balmer , Beren Sanders

In the affine fragment of continuous logic, type spaces are compact convex sets. I study some model theoretic properties of extreme types. It is proved that every complete theory $T$ has an extremal model, i.e. a model which realizes only…

Logic · Mathematics 2024-01-17 Seyed-Mohammad Bagheri

In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…

Logic · Mathematics 2022-02-24 Caleb Camrud

Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…

Logic · Mathematics 2012-11-06 Francesco Ciraulo , Maria Emilia Maietti , Giovanni Sambin

Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…

Category Theory · Mathematics 2011-04-14 Stephen Lack , Jiri Rosicky

Canonical extension has proven to be a powerful tool in algebraic study of propositional logics. In this paper we describe a generalization of the theory of canonical extension to the setting of first order logic. We define a notion of…

Category Theory · Mathematics 2012-07-05 Dion Coumans

The main result of this paper is to prove the existence of a finite basis in the description logic ${\cal ALC}$. We show that the set of General Concept Inclusions (GCIs) holding in a finite model has always a finite basis, i.e. these GCIs…

Logic in Computer Science · Computer Science 2017-01-17 Marc Aiguier , Jamal Atif , Isabelle Bloch , Céline Hudelot

The development of category theory in univalent foundations and the formalization thereof is an active field of research. Categories in that setting are often assumed to be univalent which means that identities and isomorphisms of objects…

Logic in Computer Science · Computer Science 2026-01-09 Kobe Wullaert , Niels van der Weide