Models with second order properties. IV. A general method and eliminating diamonds
From MaRDI portal
Publication:762058
DOI10.1016/0168-0072(83)90013-1zbMath0558.03014OpenAlexW2067360092MaRDI QIDQ762058
Publication date: 1983
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(83)90013-1
Related Items
Remarks in abstract model theory, Products of regular cardinals and cardinal invariants of products of Boolean algebras, Rigid models of Presburger arithmetic, The theorems of Beth and Craig in abstract model theory. III: \(\Delta\)- logics and infinitary logics, Definability of initial segments, Vive la différence. III, Models with second order properties in successors of singulars, Models with second order properties. V: A general principle, Further cardinal arithmetic, Inclusion modulo nonstationary, S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees, HIGHER MILLER FORCING MAY COLLAPSE CARDINALS, Vive la différence. II: The Ax-Kochen isomorphism theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Constructions of many complicated uncountable structures and Boolean algebras
- S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees
- Can you take Solovay's inaccessible away?
- On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements
- Classification theory and the number of non-isomorphic models
- Model theory
- Existentially closed structures in the power of the continuum
- Model-Theoretic Forcing in Logic With a Generalized Quantifier
- On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem Löwenheim theorems and compactness of related quantifiers
- Models with second order properties. III. Omitting types forL(Q)
- Models with second order properties I. Boolean algebras with no definable automorphisms
- Models with second order properties II. Trees with no undefined branches
- On definability of ordinals in logic with infinitely long expressions
- Logic with the quantifier “there exist uncountably many”