Models with compactness properties relative to an admissible language
From MaRDI portal
Publication:4154547
DOI10.1016/0003-4843(77)90009-2zbMath0376.02032OpenAlexW2071025621MaRDI QIDQ4154547
No author found.
Publication date: 1977
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(77)90009-2
Descriptive set theory (03E15) Model theory (03C99) Other infinitary logic (03C75) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
An example concerning Scott heights ⋮ Recursively saturated nonstandard models of arithmetic ⋮ A Transfer Principle for Simple Properties of Theories ⋮ Generalized reduction theorems for model-theoretic analogs of the class of coanalytic sets ⋮ A Tree Argument in Infinitary Model Theory ⋮ Classes of Ulm type and coding rank-homogeneous trees in other structures ⋮ An example related to Gregory's theorem ⋮ Condensable models of set theory ⋮ Π11 relations and paths through ⋮ Applications of Fodor's lemma to Vaught's conjecture ⋮ Automorphisms of countable recursively saturated models of PA: A survey ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ Recursively Saturated Models of Set Theory ⋮ A Spector-Gandy theorem for cPCd() classes ⋮ Bootstrapping. I ⋮ Well Quasi-orderings and Roots of Polynomials in a Hahn Field ⋮ Resplendent models and \({\Sigma_1^1}\)-definability with an oracle ⋮ Polish Group Actions and the Vaught Conjecture ⋮ Hanf number for Scott sentences of computable structures ⋮ Transplendent models: expansions omitting a type ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ Refinements of Vaught's normal from theorem ⋮ New axiomatizations for logics with generalized quantifiers ⋮ Game sentences, recursive saturation and definability ⋮ A new proof of Ajtai's completeness theorem for nonstandard finite structures ⋮ Classification from a Computable Viewpoint ⋮ Algebraic independence
This page was built for publication: Models with compactness properties relative to an admissible language