Game sentences, recursive saturation and definability

DOI10.2307/2273352zbMath0445.03014OpenAlexW1985957969MaRDI QIDQ3889030

Victor Harnik

Publication date: 1980

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273352

zbMATH Keywords

definabilityrecursive saturationgame sentences

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Interpolation, preservation, definability (03C40) Logic on admissible sets (03C70)

Related Items (1)

Some local definability results on countable topological structures

Cites Work

• The Suslin-Kleene theorem for countable structures
• Applications of vaught sentences and the covering theorem
• An introduction to recursively saturated and resplendent models
• Models with compactness properties relative to an admissible language
• Global definability theory in 𝐿_{𝜔₁𝜔}
• Some new results in definability
• On a generalization of a theorem of E. W. Beth
• Generalized interpolation and definability
• Local definability theory

This page was built for publication: Game sentences, recursive saturation and definability