Applications of Fodor's lemma to Vaught's conjecture

DOI10.1016/0168-0072(89)90063-8zbMath0663.03016OpenAlexW2041999243WikidataQ123344280 ScholiaQ123344280MaRDI QIDQ1114671

Mark Howard

Publication date: 1989

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(89)90063-8

zbMATH Keywords

treesstationary setadmissibilityVaught's conjectureFodor's lemma

Mathematics Subject Classification ID

Set-theoretic model theory (03C55) Model theory of denumerable and separable structures (03C15) Logic on admissible sets (03C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of Vaught's conjecture for \(\omega\)-stable theories
• More Lowenheim-Skolem results for admissible sets
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Some Löwenheim-Skolem results for admissible sets
• Tall α-Recursive Structures
• Some recent developments in higher recursion theory
• Saturated structures, unions of chains, and preservation theorems
• An example concerning Scott heights
• Steel forcing and barwise compactness
• Scott sentences and admissible sets
• On the number of generic models
• Applications of vaught sentences and the covering theorem
• A guide to the identification of admissible sets above structures
• An “admissible” generalization of a theorem on countable ∑11 sets of reals with applications
• Models with compactness properties relative to an admissible language
• The pure part of HYP(ℳ)
• A Tree Argument in Infinitary Model Theory
• Admissible sets and the saturation of structures
• Remarks on generic models
• Ordinal spectra of first-order theories
• The number of countable models

This page was built for publication: Applications of Fodor's lemma to Vaught's conjecture