Binary relational structures having only countably many nonisomorphic substructures

DOI10.2307/2275056zbMath0749.03022OpenAlexW4252467904MaRDI QIDQ3985085

James H. Schmerl, Dugald Macpherson

Publication date: 27 June 1992

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

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

zbMATH Keywords

countably many non-isomorphic substructurescountably many non-isomorphic subtypesdenumerable order typesdenumerable relational structures

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Basic properties of first-order languages and structures (03C07) Model theory of denumerable and separable structures (03C15)

Related Items (2)

Jumps in speeds of hereditary properties in finite relational languages ⋮ Stable structures with few substructures

This page was built for publication: Binary relational structures having only countably many nonisomorphic substructures