An example concerning Scott heights

DOI10.2307/2273623MaRDI QIDQ3966113zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(18)

• Atomic models higher up
• Categoricity of computable infinitary theories
• Classification from a Computable Viewpoint
• Polish Group Actions and the Vaught Conjecture
• Applications of Fodor's lemma to Vaught's conjecture
• The structural complexity of models of arithmetic
• Some new computable structures of high rank
• Bounds on continuous Scott rank
• Scott ranks of models of a theory
• Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
• Assigning an isomorphism type to a hyperdegree
• Equivalence Relations Induced by Actions of Polish Groups
• The countable admissible ordinal equivalence relation
• Countable structures with a fixed group of automorphisms
• An introduction to the Scott complexity of countable structures and a survey of recent results
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• Barwise: Infinitary Logic and Admissible Sets
• KNIGHT'S MODEL, ITS AUTOMORPHISM GROUP, AND CHARACTERIZING THE UNCOUNTABLE CARDINALS

This page was built for publication: An example concerning Scott heights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3966113)