Binary relational structures having only countably many nonisomorphic substructures

DOI10.2307/2275056MaRDI QIDQ3985085zbMATH OpenOpenAlexFDO

Authors Dugald Macpherson, James H. Schmerl

Publication date 27 June 1992

Published in 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

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

Recommendations

• Stable structures with few substructures
• Countable structures of given age
• Binary Homogeneous Structures I

Cited in

(9)

• Relational structures having finitely many full-cardinality restrictions
• Jumps in speeds of hereditary properties in finite relational languages
• The number of non-isomorphic ternary relations
• Countable structures of given age
• scientific article; zbMATH DE number 3557788 (Why is no real title available?)
• COUNTING SIBLINGS IN UNIVERSAL THEORIES
• Siblings of an \(\aleph_0\)-categorical relational structure
• Stable structures with few substructures
• The number of infinite substructures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985085)