Scott sentences and admissible sets
From MaRDI portal
Publication:4055986
DOI10.1016/0003-4843(74)90017-5zbMath0301.02050OpenAlexW2088529031MaRDI QIDQ4055986
Publication date: 1974
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(74)90017-5
Related Items
A contextual-hierarchical approach to truth and the liar paradox ⋮ An example concerning Scott heights ⋮ A Transfer Principle for Simple Properties of Theories ⋮ Classes of Ulm type and coding rank-homogeneous trees in other structures ⋮ Why some people are excited by Vaught's conjecture ⋮ Scott ranks of models of a theory ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Potential isomorphisms of generalized approach spaces ⋮ Applications of Fodor's lemma to Vaught's conjecture ⋮ The countable admissible ordinal equivalence relation ⋮ EHRENFEUCHT-FRAÏSSÉ GAMES ON A CLASS OF SCATTERED LINEAR ORDERS ⋮ ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE ⋮ Bounds on continuous Scott rank ⋮ Polish group actions and effectivity ⋮ Polish group actions, nice topologies, and admissible sets ⋮ Some new computable structures of high rank ⋮ Atomic models higher up ⋮ Polish Group Actions and the Vaught Conjecture ⋮ Hanf number for Scott sentences of computable structures ⋮ More Lowenheim-Skolem results for admissible sets ⋮ Some recent developments in higher recursion theory ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ Index sets for classes of high rank structures ⋮ The pure part of HYP(ℳ) ⋮ Borel equivalence relations and classifications of countable models ⋮ CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS ⋮ Categoricity of computable infinitary theories ⋮ New axiomatizations for logics with generalized quantifiers ⋮ Computable trees of Scott rank ω1CK, and computable approximation ⋮ Model theory for \(L_{\infty \omega _ 1}\) ⋮ Bounds on Scott ranks of some polish metric spaces ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS ⋮ Classification from a Computable Viewpoint ⋮ SCOTT COMPLEXITY OF COUNTABLE STRUCTURES ⋮ A boundedness principle for the Hjorth rank
