Related papers: On large externally definable sets in NIP

We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…

We provide a complete classification of the possible cofinal structures of the families of precompact (totally bounded) sets in general metric spaces, and compact sets in general complete metric spaces. Using this classification, we…

We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…

It is shown that if an infinite synchronized system has a flip, then it has infinitely many non-conjugate flips, and that the result cannot be extended to the class of coded systems.

A new characterization is given to describe implication bases of a closure system in terms of the system's quasi-closed sets. Using this characterization, it is possible to show that groups of implications corresponding to distinct…

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…

Let M be a model of Peano Arithmetic that is countably generated over an exponentially closed cut I. We characterize those sets X of subsets of I for which there is a finitely (or countably) generated cofinal extension N of M such that I is…

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Answering a special case of a question of Chernikov and Simon, we show that any non-dividing formula over a model M in a distal NIP theory is a member of a consistent definable family, definable over M.

We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…

Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…

All ultrafilters under consideration here are non-principal ultrafilters on the set omega of natural numbers. We are concerned with the possible cofinalities of ultrapowers of omega with respect to such ultrafilters. We show that no…

There exists a family $\{B_{\alpha}\}_{\alpha<\omega_1}$ of sets of countable ordinals such that o $\max B_{\alpha}=\alpha$, o if $\alpha\in B_{\beta}$ then $B_{\alpha}\subseteq B_{\beta}$, o if $\lambda\leq \alpha$ and $\lambda$ is a limit…

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

We examine the notion of anticonfinement and the role it has to play in the singularity analysis of discrete systems. A singularity is said to be anticonfined if singular values continue to arise indefinitely for the forward and backward…

While many inner model theoretic combinatorial principles are incompatible with large cardinal axioms, on some rare occasions, large cardinals actually imply that the structure of the universe of sets is analogous to the canonical inner…

Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

We continue our earlier investigation of dp-finite fields. We show that the "heavy sets" of [6] are exactly the sets of full dp-rank. As a consequence, full dp-rank is a definable property in definable families of sets. If $I$ is the group…