Assuming the existence of ω compact cardinals in a model on GCH, we prove the consistency of some new canonization properties on ω. Our aim is to get as dense patterns in the distribution of indiscernibles as possible. We prove Theorem 2.1. thm2.1Suppose the consistency of “ZFC+GCH + there are infinitely many compact cardinals”. Then the following is consistent: ZFC+GCH + and for every family 0 (...) such that for all 0shrink)

This is a survey paper giving a self-contained account of Shelah's theory of the pcf function pcf={cf:D is an ultrafilter on a}, where a is a set of regular cardinals such that a

Download  

 

Export citation  

 

Bookmark   32 citations  

We give a proof ofTheorem 1. Let κ be the smallest cardinal such that the free subset property Fr ω (κ,ω 1)holds. Assume κ is singular. Then there is an inner model with ω1 measurable cardinals.

Assume [Formula: see text]. Let [Formula: see text] be a [Formula: see text] equivalence relation coded in [Formula: see text]. [Formula: see text] has an ordinal definable equivalence class without any ordinal definable elements if and only if [Formula: see text] is unpinned. [Formula: see text] proves [Formula: see text]-class section uniformization when [Formula: see text] is a [Formula: see text] equivalence relation on [Formula: see text] which is pinned in every transitive model of [Formula: see text] containing the real (...) which codes [Formula: see text]: Suppose [Formula: see text] is a relation on [Formula: see text] such that each section [Formula: see text] is an [Formula: see text]-class, then there is a function [Formula: see text] such that for all [Formula: see text], [Formula: see text]. [Formula: see text] proves that [Formula: see text] is Jónsson whenever [Formula: see text] is an ordinal: For every function [Formula: see text], there is an [Formula: see text] with [Formula: see text] in bijection with [Formula: see text] and [Formula: see text]. (shrink)

We prove the independence of a strong partition relation on ℵ ω , answering a question of Erdos and Hajnal. We then give an almost complete answer to the free subset problem.

In this paper, we answer a question asked in Koepke et al. regarding a Mathias criteria for Tree-Prikry forcing. Also we will investigate Prikry forcing using various filters. For completeness and self inclusion reasons, we will give proofs of many known theorems.

• We define a notion of order of indiscernibility type of a structure by analogy with Mitchell order on measures; we use this to define a hierarchy of strong axioms of infinity defined through normal filters, the α-weakly Erdős hierarchy. The filters in this hierarchy can be seen to be generated by sets of ordinals where these indiscernibility orders on structures dominate the canonical functions.• The limit axiom of this is that of greatly Erdős and we use it to calibrate (...) some strengthenings of the Chang property, one of which, CC+, is equiconsistent with a Ramsey cardinal, and implies that where K is the core model built with non-overlapping extenders — if it is rigid, and others which are a little weaker. As one corollary we have:TheoremIf then there is an inner model with a strong cardinal. • We define an α-Jónsson hierarchy to parallel the α-Ramsey hierarchy, and show that κ being α-Jónsson implies that it is α-Ramsey in the core model. (shrink)

We give for ordinals α a lower bound for the least ordinal α such that Frordξ,β) and show that given enough measurable cardinals there are forcing extensions where the given bounds are sharp.

Results of Sierpiski and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is ‘narrow’ in a corresponding direction; that is, each line in that direction intersects the subset in a small set. For example, if the set ω × ω is partitioned into two pieces along the diagonal, then one piece meets every horizontal line in a finite set, and the other piece meets each vertical line in a finite set. (...) Such partitions or coverings can exist only when the sets forming the product are of limited size.This paper considers such coverings for products of infinitely many sets . In this case, a covering of the product by narrow sets, one for each coordinate direction, will exist no matter how large the factor sets are. But if one restricts the sets used in the covering , then the existence of narrow coverings is related to a number of large cardinal properties: partition cardinals, the free subset problem, nonregular ultrafilters, and so on.One result given here is a relative consistency proof for a hypothesis used by S. Mrówka to produce a counterexample in the dimension theory of metric spaces. (shrink)

The purpose of this paper is to present several applications of combinatorial principles, well-known in Set Theory, to the geometry of infinite dimensional Banach spaces, particularly to the existence of certain basic sequences. We mention also some open problems where set-theoretical techniques are relevant.

In [2], Prikry showed that if κ is a weakly inaccessible cardinal which carries a Rowbottom filter, then there is a Boolean extension of V (the universe), having the same cardinals as V, in which cf(κ) = ω. In this note, we obtain necessary and sufficient conditions which a filter D on κ must possess in order that this may be done.