Related papers: The definability of $\mathbb{E}$ in self-iterable …
We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…
Given a symmetric Dirichlet form $(\mathcal{E},\mathcal{F})$ on a (non-trivial) $\sigma$-finite measure space $(E,\mathcal{B},m)$ with associated Markovian semigroup $\{T_{t}\}_{t\in(0,\infty)}$, we prove that $(\mathcal{E},\mathcal{F})$ is…
Fix a d-minimal expansion of an ordered field. We consider the space $\mathcal D^p(M)$ of definable $\mathcal C^p$ functions defined on a definable $\mathcal C^p$ submanifold $M$ equipped with definable $\mathcal C^p$ topology. The set of…
An integer sequence $(a_n)_{n \in \mathbb{N}}$ is \emph{MC-finite} if for all $m$, the sequence $a_n \bmod m$ is eventually periodic. There are MC-finite sequences $(a_n)_{n \in \mathbb{N}}$ such that the function $F: (m,n) \mapsto a_n…
An expansion of a definably complete field either defines a discrete subring, or the image of a definable discrete set under a definable map is nowhere dense. As an application we show a definable version of Lebesgue's differentiation…
Given a field extension $F/C$, the ``Lambda closure'' $\Lambda_{F}C$ of $C$ in $F$ is a subextension of $F/C$ that is minimal with respect to inclusion such that $F/\Lambda_{F}C$ is separable. The existence and uniqueness of $\Lambda_{F}C$…
Let $\Gamma$ be a centerless irreducible higher rank arithmetic lattice in characteristic zero. We prove that if $\Gamma$ is either non-uniform or is uniform of orthogonal type and dimension at least 9, then $\Gamma$ is bi-interpretable…
We develop a unified framework for iterated symmetric extensions with countable support and, more generally, with $<\kappa$-support. Set-length iterations are treated uniformly, and when the iteration template is first-order definable over…
The technique of $\star$-translation is important in arguments calibrating the strengths of determinacy theories against large cardinals, for example in [9] and [1] in the paper's bibliography. It has also been used in analysing the…
We provide a counterexample to the Category Dichotomy in the framework of $\textsf{ZFC}$. That is, we prove the existence of an ideal on $\omega$ that is not Kat\v{e}tov below $\mathsf{nwd}$ and does not have restrictions above…
We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…
It is shown that if there is a measurable cardinal above n Woodin cardinals and M_{n+1}^# doesn't exist then K exists. K is not fully iterable, though, but only iterable with respect to stacks of certain trees living between the Woodin…
We investigate continuous functions definable in a definably complete uniformly locally o-minimal expansion of the second kind of a densely linearly ordered abelian group (DCULOAS structure). We prove a variant of the Arzela-Ascoli theorem…
In the first part of the paper, we show that if $\omega \le \kappa < \lambda$ are cardinals, $\kappa^{<\kappa} = \kappa$, and $\lambda$ is weakly compact, then in $V[\M(\kappa,\lambda)]$ the tree property at $\lambda =…
We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…
The forbidden number forb$(m,F)$, which denotes the maximum number of distinct columns in an $m$-rowed $(0,1)$-matrix with no submatrix that is a row and column permutation of $F$, has been widely studied in extremal set theory. Recently,…
Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…
A space $X$ is M-separable (selectively separable) (Scheepers, 1999; Bella et al., 2009) if for every sequence $(Y_n)$ of dense subspaces of $X$ there exists a sequence $(F_n)$ such that for each $n$ $F_n$ is a finite subset of $Y_n$ and…
A left orderable monster is a finitely generated left orderable group all of whose fixpoint-free actions on the line are proximal: the action is semiconjugate to a minimal action so that for every bounded interval $I$ and open interval $J$,…
We develop the theory of meta-iteration trees, that is, iteration trees whose base "model" is itself an ordinary iteration tree. We prove a comparison theorem for meta-iteration strategies parallel to the one for ordinary iteration…