Relational structures determined by their finite induced substructures

DOI10.2307/2274440zbMath0647.03022OpenAlexW4237484592MaRDI QIDQ3791127

H. D. Macpherson, I. M. Hodkinson

Publication date: 1988

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

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

zbMATH Keywords

absolutely ubiquitousfinitely partitionedfirst order relational languageisomorphism types of induced finite substructures

Mathematics Subject Classification ID

Basic properties of first-order languages and structures (03C07) Other classical first-order model theory (03C68)

Related Items (7)

Jumps in speeds of hereditary properties in finite relational languages ⋮ Some coinductive graphs ⋮ The age of a relational structure ⋮ Some relational structures with polynomial growth and their associated algebras II: Finite generation ⋮ Stable Absolutely Ubiquitous Structures ⋮ Complete Coinductive Theories. I ⋮ Siblings of an $\aleph_0$-categorical relational structure

This page was built for publication: Relational structures determined by their finite induced substructures