Relational Structures Determined by Their Finite Induced Substructures
Hodkinson, I. M. ; Macpherson, H. D.
J. Symbolic Logic, Tome 53 (1988) no. 1, p. 222-230 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
A countably infinite relational structure $M$ is called absolutely ubiquitous if the following holds: whenever $N$ is a countably infinite structure, and $M$ and $N$ have the same isomorphism types of finite induced substructures, there is an isomorphism from $M$ to $N$. Here a characterisation is given of absolutely ubiquitous structures over languages with finitely many relation symbols. A corresponding result is proved for uncountable structures.
Publié le : 1988-03-14
Classification:  
@article{1183742577,
     author = {Hodkinson, I. M. and Macpherson, H. D.},
     title = {Relational Structures Determined by Their Finite Induced Substructures},
     journal = {J. Symbolic Logic},
     volume = {53},
     number = {1},
     year = {1988},
     pages = { 222-230},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742577}
}

Hodkinson, I. M.; Macpherson, H. D. Relational Structures Determined by Their Finite Induced Substructures. J. Symbolic Logic, Tome 53 (1988) no. 1, pp.  222-230. http://gdmltest.u-ga.fr/item/1183742577/