Proceedings of the American Mathematical Society · 1977 · 40 citations · 4 references
HumanitiesComputer ScienceMathematicsFormal MethodsSet TheorySyntaxModel TheoryPredicate LogicAnnotation EncodingInfinite TreesUncountable Set
A tree argument is used to show that any counterexample to Vaught’s conjecture must have an uncountable model. A similar argument replaces the use of forcing by Burgess in a theorem on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sigma-summation Underscript 1 Overscript 1 Endscripts"> <mml:semantics> <mml:munderover> <mml:mo> ∑ </mml:mo> <mml:mn>1</mml:mn> <mml:mn>1</mml:mn> </mml:munderover> <mml:annotation encoding="application/x-tex">\sum _1^1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> equivalence relations.
4
The number of countable models
Michael Morley · Journal of Symbolic Logic · 1970 · 108 citations
Humanities, Mathematics, Logic +6
The number of countable models
Michael Morley · Journal of Symbolic Logic · 1970 · 43 citations
Humanities, Mathematics, Logic +6