Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

On ordinals accessible by infinitary languages

Saharon ShelahPauli VäisänenJouko Väänänen — 2005

Fundamenta Mathematicae

Let λ be an infinite cardinal number. The ordinal number δ(λ) is the least ordinal γ such that if ϕ is any sentence of L λ ω , with a unary predicate D and a binary predicate ≺, and ϕ has a model ℳ with D , a well-ordering of type ≥ γ, then ϕ has a model ℳ ’ where D ' , ' is non-well-ordered. One of the interesting properties of this number is that the Hanf number of L λ ω is exactly δ ( λ ) . It was proved in [BK71] that if ℵ₀ < λ < κ a r e r e g u l a r c a r d i n a l n u m b e r s , t h e n t h e r e i s a f o r c i n g e x t e n s i o n , p r e s e r v i n g c o f i n a l i t i e s , s u c h t h a t i n t h e e x t e n s i o n 2λ = κ a n d δ ( λ ) < λ . W e i m p r o v e t h i s r e s u l t b y p r o v i n g t h e f o l l o w i n g : S u p p o s e < λ < θ κ a r e c a r d i n a l n u m b e r s s u c h t h a t λ < λ = λ ; ∙ cf(θ) ≥ λ⁺ and μ λ < θ whenever μ < θ; ∙ κ λ = κ . Then there is a forcing...

More on the Ehrenfeucht-Fraisse game of length ω₁

Tapani HyttinenSaharon ShelahJouko Vaananen — 2002

Fundamenta Mathematicae

By results of [9] there are models and for which the Ehrenfeucht-Fraïssé game of length ω₁, E F G ω ( , ) , is non-determined, but it is consistent relative to the consistency of a measurable cardinal that no such models have cardinality ≤ ℵ₂. We now improve the work of [9] in two ways. Firstly, we prove that the consistency strength of the statement “CH and E F G ω ( , ) is determined for all models and of cardinality ℵ₂” is that of a weakly compact cardinal. On the other hand, we show that if 2 < 2 , T is a countable complete...

Page 1

Download Results (CSV)