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