Countable approximations and Löwenheim-Skolem theorems
From MaRDI portal
Publication:4138709
DOI10.1016/0003-4843(77)90010-9zbMath0364.02009OpenAlexW2045722654MaRDI QIDQ4138709
Publication date: 1977
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(77)90010-9
Related Items (28)
Compactness in singular cardinals revisited ⋮ 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ Categoricity results for \(L_{\infty \kappa}\)-free algebras ⋮ A characterization of \(\aleph _ 1\)-free Abelian groups and its application to the Chase radical ⋮ Higher indescribability and derived topologies ⋮ In singular cardinality, locally free algebras are free ⋮ Saturation Properties of Ideals in Generic Extensions. I ⋮ Classification theory through stationary logic ⋮ Semistationary and stationary reflection ⋮ κ-stationary subsets of , infinitary games, and distributive laws in Boolean algebras ⋮ On the size of closed unbounded sets ⋮ Woodin cardinals and presaturated ideals ⋮ Weak Ehrenfeucht-Fraïssé games ⋮ SQUARES, SCALES AND STATIONARY REFLECTION ⋮ The entire NS ideal on can be precipitous ⋮ Two cardinal versions of diamond ⋮ Left Separated Spaces With Point-Countable Bases ⋮ Infinitary model theory of Abelian groups ⋮ Abstract elementary classes and infinitary logics ⋮ On reflection of stationary sets in $\mathcal {P}_\kappa \lambda $ ⋮ Game ideals ⋮ More game-theoretic properties of Boolean algebras ⋮ Maximum deconstructibility in module categories ⋮ Strongly Baire trees and a cofinal branch principle ⋮ On a convenient property about \([\gamma^{\aleph_0}\)] ⋮ Model constructions in stationary logic. Part I. Forcing ⋮ On Weakly Stationary Sets ⋮ Ideals on \({P_{\kappa}(\lambda)}\) associated with games of uncountable length
This page was built for publication: Countable approximations and Löwenheim-Skolem theorems
