Article contents
Relational structures determined by their finite induced substructures
Published online by Cambridge University Press: 12 March 2014
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1988
References
REFERENCES
- 7
- Cited by