English
Related papers

Related papers: On large externally definable sets in NIP

200 papers

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

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

Logic in Computer Science · Computer Science 2018-08-16 Daniel Leivant

We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…

Logic · Mathematics 2008-08-08 J. P. Mayberry , Richard Pettigrew

We show that $\omega$-categorical rings with NIP are nilpotent-by-finite. We prove that an $\omega$-categorical group with NIP and fsg is nilpotent-by-finite. We also notice that an $\omega$-categorical group with at least one strongly…

Logic · Mathematics 2010-07-06 Krzysztof Krupinski

This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a principle that is expected to hold in Woodin's…

Logic · Mathematics 2020-07-10 Gabriel Goldberg

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear…

Logic · Mathematics 2016-09-06 Yuri Gurevich , Saharon Shelah

We discuss measures, invariant measures on definable groups, and genericity, often in an NIP (failure of the independence property) environment. We complete the proof of the third author's conjectures relating definably compact groups $G$…

Logic · Mathematics 2007-05-23 Ehud Hrushovski , Ya'acov Peterzil , Anand Pillay

We study the definability of maximal towers and of inextendible linearly ordered towers (ilt's), a notion that is more general than that of a maximal tower. We show that there is, in the constructible universe, a $\Pi^1_1$ definable maximal…

Logic · Mathematics 2018-11-22 V. Fischer , J. Schilhan

We give an alternative presentation of the ordinal notation at the strength of $\Pi^1_1-CA_0$ which allows the "uncountable" notation $\Omega$ to be interpreted "polymorphically" - that is, we allow the notation to be interpreted as…

Logic · Mathematics 2025-06-23 Henry Towsner

We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…

Rings and Algebras · Mathematics 2023-09-18 Snehinh Sen

Let $T$ be a theory which is t-minimal, meaning that with respect to some definable topology, a unary definable set $D \subseteq M$ has non-empty interior iff it is infinite. If $K$ is a definable field in $T$, then $K$ is finite or "large"…

Logic · Mathematics 2026-05-11 Will Johnson

We identify the finite list of minimal analytic n-gaps which are not countably separated, and we prove that every analytic n-gap which is not countably separated contains a gap from our finite list.

Logic · Mathematics 2014-06-30 Antonio Avilés , Stevo Todorcevic

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

Number Theory · Mathematics 2012-10-31 Gary L. Mullen , Daqing Wan , Qiang Wang

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

Social and Information Networks · Computer Science 2015-02-10 Vladan Mlinar

The cumulative hierarchy conception of set, which is based on the conception that sets are inductively generated from "former" sets, is generally considered a good way to create a set conception that seems safe from contradictions. This…

History and Overview · Mathematics 2011-11-16 Rafi Shalom

Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.

Logic · Mathematics 2020-11-30 Shlomo Eshel , Itay Kaplan

We prove an assortment of results on (commutative and unital) NIP rings, especially $\mathbb{F}_p$-algebras. Let $R$ be a NIP ring. Then every prime ideal or radical ideal of $R$ is externally definable, and every localization $S^{-1}R$ is…

Logic · Mathematics 2022-07-20 Will Johnson

We characterize the notion of definable compactness for topological spaces definable in o-minimal structures, answering questions of Peterzil and Steinhorn (1999) and Johnson (2018). Specifically, we prove the equivalence of various…

Logic · Mathematics 2025-04-29 Pablo Andújar Guerrero

We consider, for infinite cardinals kappa and alpha <= kappa^+, the group Pi(kappa,< alpha) of sequences of integers, of length kappa, with non-zero entries in fewer than alpha positions. Our main result tells when Pi(kappa,< alpha) can be…

Logic · Mathematics 2007-05-23 Andreas Blass , Saharon Shelah