Resplendency and recursive definability in \(\omega\)-stable theories

DOI10.1007/BF02760644zbMath0568.03015MaRDI QIDQ1060211

Steven Buechler

Publication date: 1984

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

saturated modelshomogeneous modelsresplendent modelomega-stable theoryrecursive definability

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Computable structure theory, computable model theory (03C57)

Related Items (3)

The spectrum of resplendency ⋮ Saturation of homogeneous resplendent models ⋮ Rich models

Cites Work

• A survey of basic stability theory, with particular emphasis on orthogonality and regular types
• Theories whose resplendent models are homogeneous
• Classification theory and the number of non-isomorphic models
• A guide to the identification of admissible sets above structures
• Finite diagrams stable in power

This page was built for publication: Resplendency and recursive definability in \(\omega\)-stable theories