Related papers: Embeddings into outer models

We investigate systems of transitive models of ZFC which are elementarily embeddable into each other and the influence of definability properties on such systems.

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…

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

An elementary embedding $j:M\rightarrow N$ between two inner models of ZFC is cardinal preserving if $M$ and $N$ correctly compute the class of cardinals. We look at the case $N=V$ and show that there is no nontrivial cardinal preserving…

We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle $\mathrm{C}_n^{(\lambda)}$ of length $n$ and edge-multiplicity $\lambda$, we determine all rotary embeddings for $n\geqslant 3$ and…

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…

Much of the theory of large cardinals beyond a measurable cardinal concerns the structure of elementary embeddings of the universe of sets into inner models. This paper seeks to answer the question of whether the inner model uniquely…

I study the modal theory of linear orders under embeddings, monotone maps, condensations, and end-extensions. I prove modality elimination for embeddings and monotone maps, show that condensations make scatteredness modally definable, and…

Given a model $\mathcal{M}$ of set theory, and a nontrivial automorphism $j$ of $\mathcal{M}$, let $\mathcal{I}_{\mathrm{fix}}(j)$ be the submodel of $\mathcal{M}$ whose universe consists of elements $m$ of $\mathcal{M}$ such that $j(x)=x$…

In this paper we establish strong embedding theorems, in the sense of the Komlos-Major-Tusnady framework, for the performance metrics of a general class of transitory queueing models of nonstationary queueing systems. The nonstationary and…

We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…

Complex systems may morph between structures with different dimensionality and degrees of freedom. As a tool for their modelling, nonlinear embeddings are introduced that encompass objects with different dimensionality as a continuous…

We show that if a non-degenerate PL map $f:N\to M$ lifts to a topological embedding in $M\times\mathbb R^k$ then it lifts to a PL embedding in there. We also show that if a stable smooth map $N^n\to M^m$, $m\ge n$, lifts to a topological…

We study the notion of non-trivial elementary embeddings $j : V \rightarrow V$ under the assumption that $V$ satisfies $ZFC$ without Power Set but with the Collection Scheme. We show that no such embedding can exist under the additional…

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…

Researchers have recently suggested that models share common representations. In our work, we find numerous geometric similarities across the token embeddings of large language models. First, we find ``global'' similarities: token…

We show that if $M$ is a countable transitive model of ZF and if $a,b$ are reals not in $M$, then there is a $G$ generic over $M$ such that $b \in L[a,G]$. We then present several applications such as the following: if $J$ is any countable…

Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item $j$ is closer to item $i$ than item $k$". Typically, each object is mapped onto a point vector in a low dimensional…

Embedding learning, a.k.a. representation learning, has been shown to be able to model large-scale semantic knowledge graphs. A key concept is a mapping of the knowledge graph to a tensor representation whose entries are predicted by models…

We explore in depth how categorical data can be processed with embeddings in the context of claim severity modeling. We develop several models that range in complexity from simple neural networks to state-of-the-art attention based…