Journal of Symbolic Logic 53 (1):222-230 (1988)
| 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
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.2307/2274440 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
PhilArchive copy
Upload a copy of this paper Check publisher's policy Papers currently archived: 71,199
External links
- From the Publisher via CrossRef (no proxy)
- projecteuclid.org
(no proxy) - projecteuclid.org [2] (no proxy)
- journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- cambridge.org (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
- Sign in / register and customize your OpenURL resolver..
- Configure custom resolver
References found in this work BETA
Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Citations of this work BETA
Similar books and articles
On Finite Rigid Structures.Yuri Gurevich & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (2):549-562.
Stable Structures with Few Substructures.Michael C. Laskowski & Laura L. Mayer - 1996 - Journal of Symbolic Logic 61 (3):985-1005.
Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures.Dugald Macpherson & James H. Schmerl - 1991 - Journal of Symbolic Logic 56 (3):876-884.
Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures.Ian Hodkinson & Martin Otto - 2003 - Bulletin of Symbolic Logic 9 (3):387-405.
Quasi-Modal Equivalence of Canonical Structures.Robert Goldblatt - 2001 - Journal of Symbolic Logic 66 (2):497-508.
Interpreting Groups in Ω-Categorical Structures.Dugald Macpherson - 1991 - Journal of Symbolic Logic 56 (4):1317-1324.
P Versus Np and Computability Theoretic Constructions in Complexity Theory Over Algebraic Structures.Gunther Mainhardt - 2004 - Journal of Symbolic Logic 69 (1):39-64.
Kolmogorov Complexity and Symmetric Relational Structures.W. L. Fouché & P. H. Potgieter - 1998 - Journal of Symbolic Logic 63 (3):1083-1094.
Notions of Relative Ubiquity for Invariant Sets of Relational Structures.Paul Bankston & Wim Ruitenburg - 1990 - Journal of Symbolic Logic 55 (3):948-986.
Countable Structures of Given Age.H. D. Macpherson, M. Pouzet & R. E. Woodrow - 1992 - Journal of Symbolic Logic 57 (3):992-1010.
Analytics
Added to PP index
2009-01-28
Total views
16 ( #668,374 of 2,517,916 )
Recent downloads (6 months)
1 ( #409,045 of 2,517,916 )
2009-01-28
Total views
16 ( #668,374 of 2,517,916 )
Recent downloads (6 months)
1 ( #409,045 of 2,517,916 )
How can I increase my downloads?
Downloads
