Stable structures homogeneous for a finite binary language

DOI10.1007/BF02760648zbMath0605.03014MaRDI QIDQ1084098

Saharon Shelah, Alistair H. Lachlan

Publication date: 1984

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

zbMATH Keywords

rankhomogeneous structurescomplexity of structurescountable stable L-structuresfinite relational languagestable structures

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Models with special properties (saturated, rigid, etc.) (03C50) Model theory of denumerable and separable structures (03C15)

Related Items

On countable stable structures which are homogeneous for a finite relational language, Structures coordinatized by indiscernible sets, Countable homogeneous multipartite graphs, Unnamed Item, A survey of homogeneous structures, Binary simple homogeneous structures are supersimple with finite rank, Binary simple homogeneous structures, Stable Finitely Homogeneous Structures

Cites Work

• Unnamed Item
• \(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures
• On countable stable structures which are homogeneous for a finite relational language
• Homogeneous graphs
• Classification theory and the number of non-isomorphic models
• Stable Finitely Homogeneous Structures
• Two conjectures regarding the stability of ω-categorical theories
• Sur l'extension aux relations de quelques propriétés des ordres