Related papers: What internal set theory knows about standard sets
We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…
In this paper we show how to build a model of $ZFC$ such that all its inner models satisfying the Axiom of Choice are well-ordered with respect to inclusion, and that said ordering is of arbitrary height (including possibly $Ord$ high). We…
This article is Part I in a series of three papers devoted to determining the minimal complexity of scales in the inner model $K(\mathbb{R})$. Here, in Part I, we shall complete our development of a fine structure theory for $K(\mathbb{R})$…
Given partial information about a set, we are interested in fully recovering the original set from what is given. If a set encodes itself robustly, any partial information about the set suffices to fully recover the information about the…
We determine sufficient structure for an elementary topos to emulate E. Nelson's Internal Set Theory in its internal language, and show that any topos satisfying the internal axiom of choice occurs as a universe of standard objects and…
In this paper, we prove that the set of all $F$-pure thresholds of ideals with fixed embedding dimension satisfies the ascending chain condition. As a corollary, given an integer $d$, we verify the ascending chain condition for the set of…
Embedders play a central role in machine learning, projecting any object into numerical representations that can, in turn, be leveraged to perform various downstream tasks. The evaluation of embedding models typically depends on…
Let kappa be the least ordinal alpha such that L_{alpha}(R) is admissible. Let A be the set of reals x such that x is ordinal definable in L_{\alpha}(R), for some alpha<kappa. It is well known that (assuming determinacy) A is the largest…
This note provides a simple result showing, under suitable technical assumptions, that if a system S adapts to a class of external signals U, then S must necessarily contain a subsystem which is capable of generating all the signals in U.…
In various places in the literature it is stated that every separable linear order embeds into the real line. This is, however, not the case, at least not with respect to the usual definition of separability. We correct this misconception.
The necessary and sufficient condition of separability of a mixed state of any systems is presented, which is practical in judging the separability of a mixed state. This paper also presents a method of finding the disentangled…
The study proposes new results on the set input-to-state stability (ISS) subject to a small input time delay for compact, invariant sets that contains the origin. First, using the nonlinear small-gain theory, we prove a Razumikhin-type…
We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate appropriate to such structures. We indicate the utility of this theory as a framework for the development…
We prove in ZFC the existence of a definable, countably saturated elementary extension of the reals. It seems that it has been taken for granted that there is no distinguished, definable nonstandard model of the reals. (This means a…
We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…
Category theory provides a powerful tool to organize mathematics. A sample of this descriptive power is given by the categorical analysis of the practice of "classes as shorthands" in ZF set theory. In this case category theory provides a…
Bayesian methods - either based on Bayes Factors or BIC - are now widely used for model selection. One property that might reasonably be demanded of any model selection method is that if a model ${M}_{1}$ is preferred to a model ${M}_{0}$,…
In many set-identified models, it is difficult to obtain a tractable characterization of the identified set. Therefore, researchers often rely on non-sharp identification conditions, and empirical results are often based on an outer set of…
We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…
Let $S\subseteq \mathbb N^p$ be a semigroup, any $P\subseteq S$ is an ideal of $S$ if $P+S\subseteq P$, and an $I(S)$-semigroup is the affine semigroup $P\cup \{0\}$, with $P$ an ideal of $S$. We characterise the $I(S)$-semigroups and the…