English
Related papers

Related papers: An Algebraic Preservation Theorem for Aleph-Zero C…

200 papers

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Rings and Algebras · Mathematics 2023-07-14 Libor Barto , Antoine Mottet

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…

Logic in Computer Science · Computer Science 2014-04-09 Jochen Burghardt

We describe a construction that to each algebraically specified notion of higher-dimensional category associates a notion of homomorphism which preserves the categorical structure only up to weakly invertible higher cells. The construction…

Category Theory · Mathematics 2011-10-17 Richard Garner

Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For…

Logic · Mathematics 2018-08-31 Gianluca Paolini , Saharon Shelah

This paper presents the proof of the coherence theorem for Ann-categories whose set of axioms and original basic properties were given in [9]. Let $$\A=(\A,{\Ah},c,(0,g,d),a,(1,l,r),{\Lh},{\Rh})$$ be an Ann-category. The coherence theorem…

Category Theory · Mathematics 2007-08-07 Nguyen Tien Quang

Catamorphisms are functions that are recursively defined on list and trees and, in general, on Algebraic Data Types (ADTs), and are often used to compute suitable abstractions of programs that manipulate ADTs. Examples of catamorphisms…

Logic in Computer Science · Computer Science 2025-02-19 Emanuele De Angelis , Fabio Fioravanti , Alberto Pettorossi , Maurizio Proietti

We extend the Ahlbrandt--Ziegler analysis of interpretability in aleph_0-categorical structures by showing that existential interpretation is controlled by the monoid of self--embeddings and positive existential interpretation of structures…

Logic · Mathematics 2009-07-20 Manuel Bodirsky , Markus Junker

This work demonstrates classical generation is preserved by the derived pushforward along the structure morphism of a noncommutative coherent algebra to its underlying scheme. Additionally, we establish that the Krull dimension of a variety…

Algebraic Geometry · Mathematics 2025-03-26 Anirban Bhaduri , Souvik Dey , Pat Lank

We study the relative algebraic closure $K$ of $\bar{\mathbb{F}}_p((t))$ inside $\bar{\mathbb{F}}((t^{\mathbb{Q}}))$. We show that the supports of elements in $K$ have order type strictly less than $\omega^\omega$. We also recover a theorem…

Number Theory · Mathematics 2023-12-29 Victor Lisinski

We study the group of automorphisms of the affine plane preserving some given curve, over any field. The group is proven to be algebraic, except in the case where the curve is a bunch of parallel lines. Moreover, a classification of the…

Algebraic Geometry · Mathematics 2016-11-24 Jérémy Blanc , Immanuel Stampfli

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

One of the most fundamental mathematical contributions of Garrett Birkhoff is the HSP theorem, which implies that a finite algebra B satisfies all equations that hold in a finite algebra A of the same signature if and only if B is a…

Logic · Mathematics 2012-12-04 Manuel Bodirsky , Michael Pinsker

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

Logic · Mathematics 2007-05-23 Alexander Berenstein , C. Ward Henson

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

We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…

Logic · Mathematics 2019-12-30 Christian Espíndola

The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates, and relies on two…

Logic in Computer Science · Computer Science 2015-07-01 Barnaby Martin , Manuel Bodirsky , Martin Hils

We develop a categorical and algebro-geometric treatment of localization for cohomological theories endowed with an open--closed recollement. Starting from a class on a space whose restriction to the open complement vanishes, we show that…

Algebraic Geometry · Mathematics 2026-04-09 Mauricio Corrêa , Simone Noja

We introduce a theory for encoding and manipulating algebraic data on categories via $\textit{concentration structures}$, which are equivalence relations on morphisms that satisfy certain axioms. For any category with a concentration…

Category Theory · Mathematics 2025-10-10 Yangxiao Luo , Shunyu Wan

We investigate the decidability and computational complexity of conservative extensions and the related notions of inseparability and entailment in Horn description logics (DLs) with inverse roles. We consider both query conservative…

Artificial Intelligence · Computer Science 2020-11-20 Jean Christoph Jung , Carsten Lutz , Mauricio Martel , Thomas Schneider