2003
DOI: 10.2178/jsl/1058448434
|View full text |Cite
|
Sign up to set email alerts
|

Canonical functions, non-regular ultrafilters and Ulam's problem on ω1

Abstract: Our main results are:Theorem 1. Con(ZFC + “every function f: ω1 → ω1 is dominated by a canonical function”) implies Con(ZFC + “there exists an inaccessible limit of measurable cardinals”). [In fact equiconsistency holds.]Theorem 3. Con(ZFC + “there exists a non-regular uniform ultrafilter on ω1”) implies Con(ZFC + “there exists an inaccessible stationary limit of measurable cardinals”).Theorem 5. Con (ZFC + “there exists an ω1-sequence of ω1-complete uniform filters on ω1 s.t. every A ⊆ ω1 is measurable w.r.t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2003
2003
2014
2014

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(24 citation statements)
references
References 15 publications
0
24
0
Order By: Relevance
“…• for all countable X ≺ (H(χ), ∈, < χ ) with λ,Q ∈ X, and for all β < ω 1 there exists a countable z ⊂ λ such that [z] <ω is a subset of…”
Section: Revision:2002-04-18 Modified:2002-04-19mentioning
confidence: 99%
See 1 more Smart Citation
“…• for all countable X ≺ (H(χ), ∈, < χ ) with λ,Q ∈ X, and for all β < ω 1 there exists a countable z ⊂ λ such that [z] <ω is a subset of…”
Section: Revision:2002-04-18 Modified:2002-04-19mentioning
confidence: 99%
“…Let X be a countable elementary substructure of (M, ∈, < * ). Let η be an ordinal in X and let z 0 , z 1 |b| → ω, defined by letting f a (y) = f (a ∪ y), is a function in X = Sk (M,∈,< * ) (X ∪ z 0 ), so f (a ∪ b) ∈ X ∩ ω 1 = X ∩ ω 1 .…”
Section: Introductionmentioning
confidence: 99%
“…A characterization using schemes is given in [3]. Here, a fourth characterization from [1] will be given.…”
Section: Function Chainsmentioning
confidence: 99%
“…If α = β + n where β is a limit ordinal and n is an integer, let α (i) = β + 2n + i for i = 0, 1. Using obvious notation, Fld(C) = Fld(A) (0) ∪ Fld(B) (1) and α (i) , β (j) ∈ C iff i < j or i = j = 0 and α, β ∈ A or i = j = 1 and α, β ∈ B.…”
Section: Interpreting Os κ + In Classesmentioning
confidence: 99%
“…3 (5) The property of being a premouse without a top extender is a Q-property. • n > 0, or • n = 0 and cr(E M top ) + M ≥ ht(Q ) then ult n ( M, σ ) is a premouse.…”
Section: Fine Structure and Ultrapowersmentioning
confidence: 99%