Related papers: Self-embeddings of models of arithmetic; fixed poi…
We investigate the structure of fixed point sets of self-embeddings of models of arithmetic. In particular, given a countable nonstandard model M of a modest fragment of Peano arithimetic, we provide complete characterizations of (a) the…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
Tanaka (1997) proved a powerful generalization of Friedman's self-embedding theorem that states that given a countable nonstandard model $(\mathcal{M},\mathcal{A})$ of the subsystem $\mathrm{WKL}_{0}$ of second order arithmetic, and any…
By a classical theorem of Harvey Friedman (1973), every countable nonstandard model $\mathcal{M}$ of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding $j$, i.e., $j$ is a self-embedding of $\mathcal{M}$ such that…
Suppose that ${\mathcal M}$ is a model of PA and ${\mathcal N}$ is a countably generated elementary end extension of ${\mathcal M}$. Let ${\mathfrak X}$ be the set of subsets of M that are coded by ${\mathcal N}$. Then ${\mathcal M}$ has a…
The differences between the $N=0$ and $N=1$ standard models are emphasized in formulating their short distance extension. We sketch methods to reproduce many of the small numbers in the model in terms of scale ratios, applying see-saw like…
This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…
The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…
We continue the study of the theories of Baldwin-Shi hypergraphs from $[5]$. Restricting our attention to when the rank $\delta$ is rational valued, we show that each countable model of the theory of a given Baldwin-Shi hypergraph is…
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…
We search for weakly interacting fixed points in extensions of the minimally supersymmetric standard model (MSSM). Necessary conditions lead to three distinct classes of anomaly-free extensions involving either new quark singlets, new quark…
We provide a theoretical foundation for non-parametric estimation of functions of random variables using kernel mean embeddings. We show that for any continuous function $f$, consistent estimators of the mean embedding of a random variable…
As predictive algorithms grow in popularity, using the same dataset to both train and test a new model has become routine across research, policy, and industry. Sample-splitting attains valid inference on model properties by using separate…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
One point compactification is studied in the light of ideal of subsets of $\mathbb{N}$. $\mathcal{I}$-proper map is introduced and showed that a continuous map can be extended continuously to the one point $\mathcal{I}$-compactification if…
We show that if $f\colon I\to I$ is piecewise monotone, post-critically finite, and locally eventually onto, then for every point $x\in X=\underleftarrow{\lim}(I,f)$ there exists a planar embedding of $X$ such that $x$ is accessible. In…
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…
Several machine learning models are defined for inputs of any size, such as graphs with different numbers of nodes and point clouds containing varying numbers of points. The universality properties of such any-dimensional models remain…
Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…