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




Related Items

An example concerning Scott heightsRecursively saturated nonstandard models of arithmeticA Transfer Principle for Simple Properties of TheoriesGeneralized reduction theorems for model-theoretic analogs of the class of coanalytic setsA Tree Argument in Infinitary Model TheoryClasses of Ulm type and coding rank-homogeneous trees in other structuresAn example related to Gregory's theoremCondensable models of set theoryΠ11 relations and paths throughApplications of Fodor's lemma to Vaught's conjectureAutomorphisms of countable recursively saturated models of PA: A surveyUnifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\)Recursively Saturated Models of Set TheoryA Spector-Gandy theorem for cPCd() classesBootstrapping. IWell Quasi-orderings and Roots of Polynomials in a Hahn FieldResplendent models and \({\Sigma_1^1}\)-definability with an oraclePolish Group Actions and the Vaught ConjectureHanf number for Scott sentences of computable structuresTransplendent models: expansions omitting a typeBarwise: Infinitary Logic and Admissible SetsRefinements of Vaught's normal from theoremNew axiomatizations for logics with generalized quantifiersGame sentences, recursive saturation and definabilityA new proof of Ajtai's completeness theorem for nonstandard finite structuresClassification from a Computable ViewpointAlgebraic independence




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