English
Related papers

Related papers: The theory of hereditarily bounded sets

200 papers

We give an example of a dense o-minimal structure in which there is a definable quotient that cannot be eliminated, even after naming parameters. Equivalently, there is an interpretable set which cannot be put in parametrically definable…

Logic · Mathematics 2019-11-25 Will Johnson

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 ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…

Logic · Mathematics 2019-07-02 Ziba Assadi , Saeed Salehi

Let $ k, n \in \mathbb{N}^+ $ and $ m \in \mathbb{N}^+ \cup \{\infty \} $. A $ k $-multiset in $ [n]_m $ is a $ k $-set whose elements are integers from $ \{1, 2, \ldots, n\} $, and each element is allowed to have at most $ m $ repetitions.…

Combinatorics · Mathematics 2024-07-09 Jiaqi Liao , Zequn Lv , Mengyu Cao , Mei Lu

We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the…

Logic in Computer Science · Computer Science 2015-02-18 Mikołaj Bojańczyk , Paweł Parys , Szymon Toruńczyk

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

Logic · Mathematics 2017-07-19 Dmytro Taranovsky

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

Group Theory · Mathematics 2018-01-16 Samuel J. v. Gool , B. Steinberg

Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$…

Commutative Algebra · Mathematics 2018-05-15 Yushuang Fan , Alfred Geroldinger , Florian Kainrath , Salvatore Tringali

Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary,…

Combinatorics · Mathematics 2012-06-11 Mark Mixer , Egon Schulte , Asia Ivic Weiss

We prove that a hereditary graph class $\mathcal{G}$ defined by finitely many excluded induced subgraphs has bounded tree-$\alpha$ if and only if it is "$(\mathrm{tw},\omega)$-bounded" (that is, for all $t\in \mathbb N$, the class of all…

Combinatorics · Mathematics 2026-05-05 Sepehr Hajebi , Sophie Spirkl

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Logic · Mathematics 2012-02-14 Artem Chernikov , Pierre Simon

In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…

Logic · Mathematics 2009-06-18 Moran Cohen , Saharon Shelah

The first-order theory of a string automatic structure is known to be decidable, but there are examples of string automatic structures with nonelementary first-order theories. We prove that the first-order theory of a string automatic…

Logic in Computer Science · Computer Science 2008-10-29 Dietrich Kuske , Markus Lohrey

Hereditarily finite sets (sets which are finite and have only hereditarily finite sets as members) are basic mathematical and computational objects, and also stand at the basis of some programming languages. This raises the need for…

Logic in Computer Science · Computer Science 2014-11-11 Giorgio Audrito , Alexandru I. Tomescu , Stephan Wagner

We prove that any definable family of subsets of a definable infinite set $A$ in an o-minimal structure has cardinality at most $|A|$. We derive some consequences in terms of counting definable types and existence of definable topological…

Logic · Mathematics 2023-06-05 Pablo Andújar Guerrero

For a given number of $k$-sets, how should we choose them so as to minimize the union-closed family that they generate? Our main aim in this paper is to show that, if $\mathcal{A}$ is a family of $k$-sets of size $\binom{t}{k}$, and $t$ is…

Combinatorics · Mathematics 2023-09-06 Žarko Ranđelović

We consider the question, which of the major classes defined by topological diagonalizations of open or Borel covers is hereditary. Many of the classes in the open case are not hereditary already in ZFC, and none of them is provably…

Logic · Mathematics 2010-11-02 Tomek Bartoszynski , Boaz Tsaban

We introduce the notion of hereditary G-compactness (with respect to interpretation). We provide a sufficient condition for a poset to not be hereditarily G-compact, which we use to show that any linear order is not hereditarily G-compact.…

Logic · Mathematics 2022-03-11 Tomasz Rzepecki

Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.

Logic · Mathematics 2026-02-23 Tomohiro Kawakami , Hiroshi Tanaka

In the paper we prove that any sumset or difference set has large E_3 energy. Also, we give a full description of families of sets having critical relations between some kind of energies such as E_k, T_k and Gowers norms. In particular, we…

Combinatorics · Mathematics 2014-05-14 Ilya D. Shkredov