On ordinals accessible by infinitary languages

Saharon Shelah; Pauli Väisänen; Jouko Väänänen

Fundamenta Mathematicae (2005)

  • Volume: 186, Issue: 3, page 193-214
  • ISSN: 0016-2736

Abstract

top
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 extension preserving all cofinalities, adding no new sets of cardinality < λ, and such that in the extension 2 λ = κ and δ(λ) = θ.

How to cite

top

Saharon Shelah, Pauli Väisänen, and Jouko Väänänen. "On ordinals accessible by infinitary languages." Fundamenta Mathematicae 186.3 (2005): 193-214. <http://eudml.org/doc/282975>.

@article{SaharonShelah2005,
abstract = {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^\{ℳ ^\{\prime \}\}, ≺^\{ℳ ^\{\prime \}\}⟩$ 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 ℵ₀ < λ < κ$ are regular cardinal numbers, then there is a forcing extension, preserving cofinalities, such that in the extension $2λ = κ$ and δ(λ) < λ⁺⁺. We improve this result by proving the following: Suppose ℵ₀ < λ < θ ≤ κ are cardinal numbers such that $∙ $λ^\{<λ\} = λ$; ∙ cf(θ) ≥ λ⁺ and $μ^λ < θ$ whenever μ < θ; ∙ $κ^λ = κ$. Then there is a forcing extension preserving all cofinalities, adding no new sets of cardinality < λ, and such that in the extension $2^\{λ\} = κ$ and δ(λ) = θ.},
author = {Saharon Shelah, Pauli Väisänen, Jouko Väänänen},
journal = {Fundamenta Mathematicae},
keywords = {Hanf number; infinitary logic; accessible ordinal},
language = {eng},
number = {3},
pages = {193-214},
title = {On ordinals accessible by infinitary languages},
url = {http://eudml.org/doc/282975},
volume = {186},
year = {2005},
}

TY - JOUR
AU - Saharon Shelah
AU - Pauli Väisänen
AU - Jouko Väänänen
TI - On ordinals accessible by infinitary languages
JO - Fundamenta Mathematicae
PY - 2005
VL - 186
IS - 3
SP - 193
EP - 214
AB - 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^{ℳ ^{\prime }}, ≺^{ℳ ^{\prime }}⟩$ 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 ℵ₀ < λ < κ$ are regular cardinal numbers, then there is a forcing extension, preserving cofinalities, such that in the extension $2λ = κ$ and δ(λ) < λ⁺⁺. We improve this result by proving the following: Suppose ℵ₀ < λ < θ ≤ κ are cardinal numbers such that $∙ $λ^{<λ} = λ$; ∙ cf(θ) ≥ λ⁺ and $μ^λ < θ$ whenever μ < θ; ∙ $κ^λ = κ$. Then there is a forcing extension preserving all cofinalities, adding no new sets of cardinality < λ, and such that in the extension $2^{λ} = κ$ and δ(λ) = θ.
LA - eng
KW - Hanf number; infinitary logic; accessible ordinal
UR - http://eudml.org/doc/282975
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.