English
Related papers

Related papers: Equivalents of NOTOP

200 papers

In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…

Computational Geometry · Computer Science 2019-08-07 Michael G. Dobbins , Andreas Holmsen , Tillmann Miltzow

We study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in [T. Hyttinen, On nonstructure of elementary submodels of a stable homogeneous structure, Fundamenta Mathematicae, 156(1998):…

Logic · Mathematics 2007-05-23 Tapani Hyttinen , Saharon Shelah

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…

Logic · Mathematics 2007-05-23 John Goodrick

We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…

Logic · Mathematics 2021-07-02 Pierre Simon

In this paper we prove a strong nonstructure theorem for kappa (T)-saturated models of a stable theory T with dop.

Logic · Mathematics 2009-09-25 Tapani Hyttinen , Saharon Shelah

We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories…

Logic · Mathematics 2023-05-30 Itay Kaplan , Nicholas Ramsey , Pierre Simon

An $N$-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable $N$-free posets and some labelled ordered trees to show that a…

Combinatorics · Mathematics 2023-01-09 Davoud Abdi

We relate R-equivalence on tori with Voevodsky's theory of homotopy invariant Nisnevich sheaves with transfers and effective motivic complexes.

Algebraic Geometry · Mathematics 2015-02-03 Bruno Kahn

We introduce the notion of strong $p$-semi-regularity and show that if $p$ is a regular type which is not locally modular then any $p$-semi-regular type is strongly $p$-semi-regular. Moreover, for any such $p$-semi-regular type, "domination…

Logic · Mathematics 2024-04-16 Elisabeth Bouscaren , Bradd Hart , Ehud Hrushovski , Michael C. Laskowski

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

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…

Logic · Mathematics 2018-12-07 Miloš S. Kurilić

For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…

Logic · Mathematics 2025-02-04 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of 'pure instability' that we call 'distality' in which no such phenomenon occurs. O-minimal theories and the p-adics for example are…

Logic · Mathematics 2015-09-24 Pierre Simon

A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…

Logic · Mathematics 2007-05-23 Saharon Shelah

We introduce trace definability, a weak notion of interpretability, and trace equivalence, a weak notion of equivalence for first order structures and theories. In particular we get an interesting weak equivalence notion for $\mathrm{NIP}$…

Logic · Mathematics 2022-04-07 Erik Walsberg

Assume a complete superstable theory is superstable, and let P be a class of regular types, typically closed under automorphisms of the monster and non-orthogonality. We define the notion of P-NDOP and prove the existence of…

Logic · Mathematics 2014-06-05 Saharon Shelah , Michael C. Laskowski

Suppose $T$ is totally transcendental and every minimal non-locally-modular type is nonorthogonal to a nonisolated minimal type over the empty set. It is shown that a finite rank type $p=tp(a/A)$ is isolated if and only if $a$ is…

Logic · Mathematics 2018-10-10 Omar León Sánchez , Rahim Moosa

We prove some results about the theory of independence in $\mathrm{NSOP}_{3}$ theories that do not hold in $\mathrm{NSOP}_{4}$ theories. We generalize Chernikov's work on simple and co-simple types in $\mathrm{NTP}_{2}$ theories to types…

Logic · Mathematics 2026-05-29 Scott Mutchnik

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

Motivated by structural properties of differential field extensions, we introduce the notion of a theory $T$ being derivation-like with respect to another model complete theory $T_0$. We prove that when $T$ admits a model companion $T_+$,…

Logic · Mathematics 2025-03-25 Omar Leon Sanchez , Shezad Mohamed
‹ Prev 1 2 3 10 Next ›