You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Relational Structures Determined by Their Finite Induced Substructures
I. M. Hodkinson and H. D. Macpherson
The Journal of Symbolic Logic
Vol. 53, No. 1 (Mar., 1988), pp. 222-230
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2274440
Page Count: 9
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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.
The Journal of Symbolic Logic © 1988 Association for Symbolic Logic