Related papers: Of Mice and Machetes
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…
Assuming an instance of the Brodsky-Rinot proxy principle holding at a regular uncountable cardinal $\kappa$, we construct $2^\kappa$-many pairwise non-embeddable minimal non-$\sigma$-scattered linear orders of size $\kappa$. In particular,…
We show that if the weak compactness of a cardinal is made indestructible by means of any preparatory forcing of a certain general type, including any forcing naively resembling the Laver preparation, then the cardinal was originally…
Let $Z_3$ denote $3^{rd}$ order arithmetic. Let Harrington's Principle, HP, denote the statement that there is a real $x$ such that every $x$--admissible ordinal is a cardinal in $L$. In this paper, assuming there exists a remarkable…
Assuming the existence of a supercompact cardinal and an inaccessible above it, we construct a model of ZFC, in which all uncountable regular cardinals are inaccessible in HOD.
We study the Magidor iteration of Prikry forcings below a measurable limit of measurables $ \kappa $. We first characterize all the normal measures $ \kappa $ carries in the generic extension, building on and extending the main result of…
If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…
While maximal independent families can be constructed from ZFC via Zorn's lemma, the presence of a maximal $\sigma$-independent family already gives an inner model with a measurable cardinal, and Kunen has shown that from a measurable…
An optimal extension of the Jensen covering lemma, within the limits imposed by Prikry forcing, is proved. If L[E] is an "iterable" weasel with no measurable cardinals, then either L[E] has "indiscernibles", or every uncountable set of…
Assume the existence of sufficent large cardinals. Let $M_{\mathrm{sw}n}$ be the minimal iterable proper class $L[E]$ model satisfying "there are $\delta_0<\kappa_0<\ldots<\delta_{n-1}<\kappa_{n-1}$ such that the $\delta_i$ are Woodin…
We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly $\theta$-supercompact, for any desired $\theta$. In addition, we prove several global results…
In the Engel group with its Carnot group structure we study subsets of locally finite subRiemannian perimeter and possessing constant subRiemannian normal. We prove the rectifiability of such sets: more precisely we show that, in some…
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…
Let $M$ be a short extender mouse. We prove that if $E\in M$ and $M$ satisfies "$E$ is a countably complete short extender whose support is a cardinal $\theta$ and $\mathcal{H}_\theta\subseteq\mathrm{Ult}(V,E)$", then $E$ is in the extender…
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…
The two parallel concepts of "small" sets of the real line are meagre sets and null sets. Those are equivalent to Cohen forcing and Random real forcing for $\aleph^{\aleph_0}_0$; in spite of this similarity, the Cohen forcing and Random…
The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…
Mittag-Leffler modules occur naturally in algebra, algebraic geometry, and model theory, [18], [12], [17]. If $R$ is a non-right perfect ring, then it is known that in contrast with the classes of all projective and flat modules, the class…
Let M be a random (alpha n) x n matrix of rank r<<n, and assume that a uniformly random subset E of its entries is observed. We describe an efficient algorithm that reconstructs M from |E| = O(rn) observed entries with relative root mean…
This article is the second part of an essay dedicated to lattices freely generated by posets within a variety. The first part dealt with four easy varieties while this part is concerned with finitely generated varieties. Here we present a…