An example concerning Scott heights

DOI10.2307/2273623zbMath0501.03018OpenAlexW2163355682MaRDI QIDQ3966113

Michael Makkai

Publication date: 1981

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273623

zbMATH Keywords

automorphism groupsadmissible setScott sentenceuncountable modelsgroup-treethin ordered trees

Mathematics Subject Classification ID

Logic on admissible sets (03C70)

Related Items

Scott ranks of models of a theory ⋮ KNIGHT'S MODEL, ITS AUTOMORPHISM GROUP, AND CHARACTERIZING THE UNCOUNTABLE CARDINALS ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Applications of Fodor's lemma to Vaught's conjecture ⋮ The countable admissible ordinal equivalence relation ⋮ ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE ⋮ Bounds on continuous Scott rank ⋮ Some new computable structures of high rank ⋮ Atomic models higher up ⋮ Polish Group Actions and the Vaught Conjecture ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ Equivalence Relations Induced by Actions of Polish Groups ⋮ Categoricity of computable infinitary theories ⋮ COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ ⋮ Countable structures with a fixed group of automorphisms ⋮ Classification from a Computable Viewpoint ⋮ SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

Cites Work

• Refuting Ehrenfeucht conjecture on rigid models
• Scott sentences and admissible sets
• An “admissible” generalization of a theorem on countable ∑11 sets of reals with applications
• Models with compactness properties relative to an admissible language