Models with compactness properties relative to an admissible language

DOI10.1016/0003-4843(77)90009-2zbMATH Open0376.02032OpenAlexW2071025621MaRDI QIDQ4154547FDOQ4154547

Author name not available (Why is that?)

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

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Descriptive set theory (03E15) Other infinitary logic (03C75) Model theory (03C99)

Cited In (27)

• Bootstrapping. I
• Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)
• Classification from a Computable Viewpoint
• New axiomatizations for logics with generalized quantifiers
• An example related to Gregory's theorem
• A Spector-Gandy theorem for cPC_d() classes
• Polish Group Actions and the Vaught Conjecture
• Applications of Fodor's lemma to Vaught's conjecture
• A new proof of Ajtai's completeness theorem for nonstandard finite structures
• Recursively saturated nonstandard models of arithmetic
• Hanf number for Scott sentences of computable structures
• Transplendent models: expansions omitting a type
• Π₁¹ relations and paths through
• Generalized reduction theorems for model-theoretic analogs of the class of coanalytic sets
• Automorphisms of countable recursively saturated models of PA: A survey
• Well Quasi-orderings and Roots of Polynomials in a Hahn Field
• A Tree Argument in Infinitary Model Theory
• Game sentences, recursive saturation and definability
• A Transfer Principle for Simple Properties of Theories
• An example concerning Scott heights
• Algebraic independence
• Refinements of Vaught's normal from theorem
• Recursively Saturated Models of Set Theory
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• Barwise: Infinitary Logic and Admissible Sets
• Resplendent models and \({\Sigma_1^1}\)-definability with an oracle
• Condensable models of set theory

This page was built for publication: Models with compactness properties relative to an admissible language

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