Related papers: Higher indescribability and derived topologies
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
A cardinal $\lambda$ satisfies a property P robustly if, whenever $\mathbb{Q}$ is a forcing poset and $|\mathbb{Q}|^+ < \lambda$, $\lambda$ satisfies P in $V^{\mathbb{Q}}$. We study the extent to which certain reflection properties of large…
We find many conditions equivalent to the model-theoretical property $\lambda \stackrel{\kappa}{\Rightarrow} \mu$ introduced in [L1]. Our conditions involve uniformity of ultrafilters, compactness properties of products of topological…
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…
$\Sigma^1_3$-absoluteness for ccc forcing means that for any ccc forcing $P$, ${H_{\omega_1}}^V \prec_{\Sigma_2}{H_{\omega_1}}^{V^P}$. "$\omega_1$ inaccessible to reals" means that for any real $r$, ${\omega_1}^{L[r]}<\omega_1$. To measure…
We obtain results on the condensation principle called local club condensation. We prove that in extender models an equivalence between the failure of local club condensation and subcompact cardinals holds. This gives a characterization of…
Given a module $X$ and a regular cardinal $\kappa$ we study various notions of $(\kappa,\mathrm{Add}(X))$-freeness and $(\kappa,\mathrm{Add}(X))$-separability. Bearing on appropriate set-theoretic assumptions, we construct a non-trivial…
For $\kappa$ a cardinal, a space $X=(X,\sT)$ is $\kappa$-{\it resolvable} if $X$ admits $\kappa$-many pairwise disjoint $\sT$-dense subsets; $(X,\sT)$ is {\it exactly} $\kappa$-{\it resolvable} if it is $\kappa$-resolvable but not…
There has recently been work by multiple groups in extracting the properties associated with cardinal invariants of the continuum and translating these properties into similar analogous combinatorial properties of computational oracles.…
The additivity spectrum ADD(I) of an ideal I is the set of all regular cardinals kappa such that there is an increasing chain {A_alpha:alpha<kappa\} in the ideal I such that the union of the chain is not in I. We investigate which set A of…
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 improve the upper bound for the consistency strength of stationary reflection at successors of singular cardinals.
Given a strong limit cardinal $\lambda$ of countable cofinality, we show that if every $\lambda$-coanalytic subset of the generalised Cantor space ${}^{\lambda}2$ has the $\lambda$-$\mathsf{PSP}$, then there is an inner model with…
First derivatives of the Whittaker function $\mathrm{M}_{\kappa ,\mu }\left(x\right) $ with respect to the parameters are calculated. Using the confluent hypergeometric function, these derivarives can be expressed as infinite sums of…
We show that if $\lambda^{<\kappa} = \lambda$ and every normal filter on $P_\kappa\lambda$ can be extended to a $\kappa$-complete ultrafilter then so does every $\kappa$-complete filter on $\lambda$. This answers a question of Gitik.
Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to…
We introduce a generalization of stationary set reflection which we call "filter reflection", and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We prove the independence of filter reflection…
We introduce a model of infinitary computation which enhances the infinite time Turing machine model slightly but in a natural way by giving the machines the capability of detecting cardinal stages of computation. The computational strength…
For any subset $Z \subseteq \mathbb{Q}$, consider the set $S_Z$ of subfields $L\subseteq \overline{\mathbb{Q}}$ which contain a co-infinite subset $C \subseteq L$ that is universally definable in $L$ such that $C \cap \mathbb{Q}=Z$. Placing…
We prove some consistency results about b(lambda) and d(lambda), which are natural generalisations of the cardinal invariants of the continuum b and d. We also define invariants b_cl(lambda) and d_cl(lambda), and prove that almost always…