The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1

Displaying 1 – 5 of 5

Showing per page

On equivalence relations second order definable over H(κ)

Saharon Shelah, Pauli Vaisanen (2002)

Fundamenta Mathematicae

Let κ be an uncountable regular cardinal. Call an equivalence relation on functions from κ into 2 second order definable over H(κ) if there exists a second order sentence ϕ and a parameter P ⊆ H(κ) such that functions f and g from κ into 2 are equivalent iff the structure ⟨ H(κ), ∈, P, f, g ⟩ satisfies ϕ. The possible numbers of equivalence classes of second order definable equivalence relations include all the nonzero cardinals at most κ⁺. Additionally, the possibilities are closed under unions...

On ordinals accessible by infinitary languages

Saharon Shelah, Pauli Väisänen, Jouko 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...

Currently displaying 1 – 5 of 5

Page 1