English
Related papers

Related papers: Mekler's construction and tree properties

200 papers

Mekler's construction gives an interpretation of any structure in a finite relational language in a group (nilpotent of class $2$ and exponent $p>2$, but not finitely generated in general). Even though this construction is not a…

Logic · Mathematics 2018-07-10 Artem Chernikov , Nadja Hempel

Mekler's construction is a powerful technique for building purely algebraic structures from combinatorial ones. Its power lies in the fact that it allows various model-theoretic tameness properties of the combinatorial structure to transfer…

Logic · Mathematics 2026-03-25 Blaise Boissonneau , Aris Papadopoulos , Pierre Touchard

We give criteria for a first-order theory to be NCTP or NBTP using tree-indiscernibility. As an application, we show that Mekler's construction preserves NCTP and NBTP.

Logic · Mathematics 2026-03-24 JinHoo Ahn , Joonhee Kim

Tree properties are introduced by Shelah, and it is well-known that a theory has TP (the tree property) if and only if it has TP$_1$ or TP$_2$. In any simple theory (i.e., a theory not having TP), forking supplies a good independence notion…

Logic · Mathematics 2019-07-05 Enrique Casanovas , Byunghan Kim

We study model theoretic tree properties ($\text{TP}, \text{TP}_1, \text{TP}_2$) and their associated cardinal invariants ($\kappa_{\text{cdt}}, \kappa_{\text{sct}}, \kappa_{\text{inp}}$, respectively). In particular, we obtain a…

Logic · Mathematics 2016-10-24 Artem Chernikov , Nicholas Ramsey

We prove that the NTP$_1$ property of a geometric theory $T$ is inherited by theories of lovely pairs and $H$-structures associated to $T$. We also provide a class of examples of nonsimple geometric NTP$_1$ theories.

Logic · Mathematics 2023-11-14 Jan Dobrowolski , Hyeungjoon Kim

The paper deals with two issues: the existence of universal models of a theory T and related properties when cardinal arithmetic does not give this existence offhand. In the first section we prove that simple theories (e.g., theories…

Logic · Mathematics 2008-02-03 Saharon Shelah

We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…

Logic · Mathematics 2023-02-14 Samuel Braunfeld , Anuj Dawar , Ioannis Eleftheriadis , Aris Papadopoulos

In this paper, we study some tree properties and their related indiscernibilities. First, we prove that SOP$_2$ can be witnessed by a formula with a tree of tuples holding 'arbitrary homogeneous inconsistency' (e.g., weak k-TP$_1$…

Logic · Mathematics 2023-12-12 JinHoo Ahn , Joonhee Kim

We give two consistent constructions of trees $T$ whose finite power $T^{n+1}$ is sharply different from $T^n$: 1. An $\aleph_1$-tree $T$ whose interval topology $X_T$ is perfectly normal, but $(X_T)^2$ is not even countably metacompact. 2.…

Logic · Mathematics 2026-04-22 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…

Logic · Mathematics 2026-05-20 Pablo Andújar Guerrero

In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic…

Logic · Mathematics 2020-05-22 Gabriel Conant , Kyle Gannon

We state a construction theorem for specifications starting from single-site conditional probabilities (singleton part). We consider general single-site spaces and kernels that are absolutely continuous with respect to a chosen product…

Probability · Mathematics 2007-05-23 Roberto Fernandez , Gregory Maillard

We generalize the Unstable Formula Theorem characterization of stable theories from \citep{sh78}: that a theory $T$ is stable just in case any infinite indiscernible sequence in a model of $T$ is an indiscernible set. We use a generalized…

Logic · Mathematics 2013-03-15 Lynn Scow

We introduce some properties describing dependence in indiscernible sequences: $F_{ind}$ and its dual $F_{Mb}$, the definable Morley property, and $n$-resolvability. Applying these properties, we establish the following results: We show…

Logic · Mathematics 2026-04-29 John Baldwin , James Freitag , Scott Mutchnik

We prove the existence and uniqueness of multiple SLE$_\kappa$ associated with any given link pattern for $\kappa\in (4,6]$. We also have the uniqueness for $\kappa\in (6,8)$. The multiple SLE$_\kappa$ law is constructed by first…

Probability · Mathematics 2023-08-29 Dapeng Zhan

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…

Logic · Mathematics 2019-01-18 P. D. Welch

Given a structure $\mathcal{M}$ and a stably embedded $\emptyset$-definable set $Q$, we prove tameness preservation results when enriching the induced structure on $Q$ by some further structure $\mathcal{Q}$. In particular, we show that if…

Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…

Group Theory · Mathematics 2013-11-21 Volker Diekert , Armin Weiß

We study and characterize stability, NIP and NSOP in terms of topological and measure theoretical properties of classes of functions. We study a measure theoretic property, `Talagrand's stability', and explain the relationship between this…

Logic · Mathematics 2021-11-19 Karim Khanaki
‹ Prev 1 2 3 10 Next ›