This paper investigates the role recursive structures play in prosody. In current understanding, phonological phrasing is computed by a general syntax–prosody mapping algorithm. Here, we are interested structure that arises response to morphosyntactic needs be mapped. We investigate types of found prosody, specifically: For prosodic category κ, besides adjunctive type recursion κ[κ x], κ[x κ], ...

We prove the following: (1) If κ is weakly inaccessible then NSκ is not κ+-saturated. (2) If κ is weakly inaccessible and θ < κ is regular then NSθ κ is not κ +saturated. (3) If κ is singular then NS κ+ is not κ++-saturated. Combining this with previous results of Shelah, one obtains the following: (A) If κ > א1 then NSκ is not κ+-saturated. (B) If θ+ < κ then NSθ κ is not κ +-saturated.

We are proving the following: (1) If κ is a weakly inaccessible then NSκ is not κ -saturated. (2) If κ is a weakly inaccessible and θ < κ is regular then NS κ is not κ saturated. (3) If κ is singular then NS κ+ is not κ-saturated. Combining this with previous results of Shelah, one obtains the following: (A) If κ > א1 then NSκ is not κ -saturated. (B) If θ < κ then NS κ is not κ -saturated.

Fe–30Mn–10.5Al–1.1C alloys with different Mo and Ni contents are prepared to investigate the phase transformation behavior mechanical properties of austenitic lightweight steels. Solution-treated samples have microstructures consisting an austenite matrix ordered κ-carbides, size κ-carbides decreases addition or Ni. In addition, body-centered cubic (BCC) phases B2 DO3 also form when 3wt%Mo 3wt%...

Definition 0.1 Let δ be a cardinal. We say that δ is Woodin with 3 iff there is some sequence (a κ : κ < δ) such that a κ ⊂ V κ for every κ < δ and for every A ⊂ V δ the set {κ < δ : A ∩ V κ = a κ ∧ κ is A–strong up to δ} is stationary in δ. Proof. Let us define ((a κ , c κ) : κ < δ) recursively as follows. If ((a κ , c κ) : κ < µ) is defined for some µ < δ, then we let (a µ , c µ) be the least...