Related papers: A note on the Revised GCH
A property of a filter, a kind of large cardinal property, suffices for the proof in Liu Shelah [LiSh:484] and is proved consistent as required there. A natural property which looks better, not only is not obtained here, but is shown to be…
Shelah shows that certain revised countable support (RCS) iterations do not add reals. His motivation is to establish the independence (relative to large cardinals) of Avraham's problem on the existence of uncountable non-constuctible…
In [Sh893], Shelah proves that (on a stationary set of cardinals) an AEC has not too many models or every model has extensions of arbitrary cardinality. We show that, if we assume limited amalgamation, then the second condition holds for a…
The consistency of a second-order version of a theorem of Morley on the number of countable models was proved in arXiv:2107.07636 with the aid of large cardinals. We here dispense with them.
Shelah's own proof to his recent polarized partition theorem involving a singular strong limit that violates the GCH is presented. The proof is slightly re-arranges so that no use of the ideal I[\lambda] is made. The proof should be…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah math.LO/0407498 and studied also in math.LO/0605067. We introduce a general scheme of generating a filter on lambda from filters on smaller…
We study the strength of well-founded ultrafilters on ordinals above choiceless large cardinals and their associated Prikry forcings. Gabriel Goldberg showed that all but boundedly many regular cardinals above a rank Berkeley cardinal carry…
In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…
Modulo the existence of large cardinals, there is a model of set theory in which for some set $B$ of regular cardinals, the sequence $\langle \text{pcf}^\alpha(B): \alpha \in \text{Ord} \rangle$ is strictly increasing. The result answers a…
We exhibit a forcing for producing a model with no nowhere dense ultrafilters that satisfies the full Sacks Property. By interleaving this forcing with other forcing notions, a model containing a $(2, {\aleph}_{0})$-selective ultrafilter,…
We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially Cohen-Macaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.
We show from a weak comparison principle (the Ultrapower Axiom) that the Mitchell order is linear on certain kinds of ultrafilters: normal ultrafilters, Dodd solid ultrafilters, and assuming GCH, generalized normal ultrafilters. In the…
We show that Shelah cardinals are preserved under the canonical $GCH$ forcing notion. We also show that if $GCH$ holds and $F:REG\rightarrow CARD$ is an Easton function which satisfies some weak properties, then there exists a cofinality…
Assuming an abstract comparison principle called the Ultrapower Axiom, which is motivated by the comparison process of inner model theory and generalizes the statement that the Mitchell order is linear on normal ultrafilters, we…
This paper generalizes Shelah's generic pair conjecture (now theorem) for the measurable cardinal case from first order theories to finite diagrams. We use homogeneous models in the place of saturated models.
Let $M$ denote the Merimovich's model in which for each infinite cardinal $\lambda, 2^\lambda=\lambda^{+3}$. We show that in $M$ the following hold: (1) Shelah's strong hypothesis fails at all singular cardinals, indeed, $\forall \lambda…
We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…
Shelah has shown that there are no chains of length $\omega_3$ increasing modulo finite in ${}^{\omega_2}\omega_2$. We improve this result to sets. That is, we show that there are no chains of length $\omega_3$ in $[\omega_2]^{\aleph_2}$…
In recent years, G\"odel's ontological proof and variations of it were formalized and analyzed with automated tools in various ways. We supplement these analyses with a modeling in an automated environment based on first-order logic…