Related papers: Set theory without choice: not everything on cofin…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…
We prove that $\mu=\mu^{<\mu}$, $2^\mu=\mu^+$ and ``there is a non reflecting stationary subset of $\mu^+$ composed of ordinals of cofinality $<\mu$'' imply that there is a $\mu$-complete Souslin tree on $\mu^+$.
The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
In a classical paper by Ben-David and Magidor, a model of set theory was exhibited in which $\aleph_{\omega+1}$ carries a uniform ultrafilter that is $\theta$-indecomposable for every uncountable cardinal $\theta<\aleph_\omega$. In this…
This paper contributes to the set-theoretic side of understanding Keisler's order. We consider properties of ultrafilters which affect saturation of unstable theories: the lower cofinality $\lcf(\aleph_0, \de)$ of $\aleph_0$ modulo $\de$,…
We prove that, assuming $\mathrm{ZF}$, and restricted to any pointed set, Chaitin's $\Omega_U:x\mapsto \Omega_U^x=\sum_{U^x(\sigma)\downarrow}2^{-|\sigma|}$ is not injective for any universal prefix-free Turing machine $U$, and that…
Suppose $M$ is a transitive class size model of $AD_{\mathbb{R}}+``\Theta$ is regular". $M$ is a minimal model of $AD_{\mathbb{R}}+``\Theta$ is measurable" if (i) $\mathbb{R}, Ord\subseteq M$ (ii) there is $\mu\in M$ such that $M\models…
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…
We give several topological/combinatorial conditions that, for a filter on $\omega$, are equivalent to being a non-meager $\mathsf{P}$-filter. In particular, we show that a filter is countable dense homogeneous if and only if it is a…
Let F be a finite field of characteristic 2 and h be the element x^3+y^3+xyz of F[[x,y,z]]. In an earlier paper we made a precise conjecture as to the values of the colengths of the ideals (x^q,y^q,z^q,h^j) for q a power of 2. We also…
We prove that it is relatively consistent with $\mathrm{ZFC}$ that every strong measure zero subset of the real line is meager-additive while there are uncountable strong measure zero sets (i.e., Borel's conjecture fails). This answers a…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, or logically undetermined, within this axiomatic system.…
There is a model of ZF with a $\Delta^1_3$ definable Hamel basis in which $AC_\omega(R)$ fails.
We prove that if $\mu>{\rm cf}(\mu)=\omega$ and $2^\mu=\mu^+$ then $\binom{\mu^+}{\mu}\nrightarrow\binom{\mu^+\ \aleph_2}{\mu\ \mu}$.
In the conventional formulation, it is broadly accepted that simultaneous measurability and commutativity of observables are equivalent. However, several objections have been claimed that there are cases in which even nowhere commuting…
A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…
We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…