An introduction to recursively saturated and resplendent models
From MaRDI portal
Publication:4110996
DOI10.2307/2272253zbMath0343.02032OpenAlexW4256112807MaRDI QIDQ4110996
Publication date: 1976
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272253
Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Other model constructions (03C30) Other classical first-order model theory (03C68)
Related Items (37)
P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) ⋮ Condensable models of set theory ⋮ Expansions of models of ω-stable theories ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ The spectrum of resplendency ⋮ INTERPRETATIONS BETWEENω-LOGIC AND SECOND-ORDER ARITHMETIC ⋮ The isomorphism property for nonstandard universes ⋮ Saturation of homogeneous resplendent models ⋮ Axiomatizing first-order consequences in dependence logic ⋮ What does logic have to tell us about mathematical proofs? ⋮ Real closures of models of weak arithmetic ⋮ Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts ⋮ COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES ⋮ Elementary properties of free extensions ⋮ Axiomatizing first order consequences in inclusion logic ⋮ Nonstandard definability ⋮ Positive logics ⋮ Pairs of recursive structures ⋮ Kernels, truth and satisfaction ⋮ Axiomatizing first-order consequences in independence logic ⋮ Model theory of the regularity and reflection schemes ⋮ Resplendent models and \({\Sigma_1^1}\)-definability with an oracle ⋮ Transplendent models: expansions omitting a type ⋮ Barwise: Infinitary Logic and Admissible Sets ⋮ Real closed fields and models of Peano arithmetic ⋮ Some applications of Henkin quantifiers ⋮ On expandability of models of Peano arithmetic. III ⋮ Ideal models and some not so ideal problems in the model theory of L(Q) ⋮ New axiomatizations for logics with generalized quantifiers ⋮ Game sentences, recursive saturation and definability ⋮ On models of the elementary theory of (Z, +, 1) ⋮ On a problem of MacDowell and Specker ⋮ Some useful preservation theorems ⋮ A new proof of Ajtai's completeness theorem for nonstandard finite structures ⋮ Extendible Sets in Peano Arithmetic ⋮ Generalizing classical and effective model theory in theories of operations and classes ⋮ Models of the alternative set theory
This page was built for publication: An introduction to recursively saturated and resplendent models
