Countable approximations and Löwenheim-Skolem theorems
From MaRDI portal
Publication:4138709
Cited in
(30)- Game ideals
- On a convenient property about \([\gamma]^{\aleph_0}\)
- Categoricity results for \(L_{\infty \kappa}\)-free algebras
- A characterization of \(\aleph _ 1\)-free Abelian groups and its application to the Chase radical
- In singular cardinality, locally free algebras are free
- On the size of closed unbounded sets
- Woodin cardinals and presaturated ideals
- Infinitary model theory of Abelian groups
- Strongly Baire trees and a cofinal branch principle
- Classification theory through stationary logic
- Maximum deconstructibility in module categories
- Ideals on \({P_{\kappa}(\lambda)}\) associated with games of uncountable length
- Squares, scales and stationary reflection
- Weak Ehrenfeucht-Fraïssé games
- Left Separated Spaces With Point-Countable Bases
- On Weakly Stationary Sets
- Model constructions in stationary logic. Part I. Forcing
- Saturation Properties of Ideals in Generic Extensions. I
- The entire NS ideal on can be precipitous
- On reflection of stationary sets in $\mathcal {P}_\kappa \lambda $
- Compactness in singular cardinals revisited
- 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
- Semistationary and stationary reflection
- κ-stationary subsets of , infinitary games, and distributive laws in Boolean algebras
- Higher indescribability and derived topologies
- The strategic balance of games in logic
- Two cardinal versions of diamond
- Universality properties of forcing
- More game-theoretic properties of Boolean algebras
- Abstract elementary classes and infinitary logics
This page was built for publication: Countable approximations and Löwenheim-Skolem theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138709)
