{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T10:28:15Z","timestamp":1775557695250,"version":"3.50.1"},"reference-count":9,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":9507,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1988,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A countably infinite relational structure <jats:italic>M<\/jats:italic> is called <jats:italic>absolutely ubiquitous<\/jats:italic> if the following holds: whenever <jats:italic>N<\/jats:italic> is a countably infinite structure, and <jats:italic>M<\/jats:italic> and <jats:italic>N<\/jats:italic> have the same isomorphism types of finite induced substructures, there is an isomorphism from <jats:italic>M<\/jats:italic> to <jats:italic>N<\/jats:italic>. Here a characterisation is given of absolutely ubiquitous structures over languages with finitely many relation symbols. A corresponding result is proved for uncountable structures.<\/jats:p>","DOI":"10.2307\/2274440","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T22:24:27Z","timestamp":1146954267000},"page":"222-230","source":"Crossref","is-referenced-by-count":8,"title":["Relational structures determined by their finite induced substructures"],"prefix":"10.1017","volume":"53","author":[{"given":"I. M.","family":"Hodkinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. D.","family":"Macpherson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200029054_bib007","volume-title":"An introduction to stability theory","author":"Pillay","year":"1983"},{"key":"S0022481200029054_bib005","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90046-8"},{"key":"S0022481200029054_bib002","volume-title":"Model theory","author":"Chang","year":"1973"},{"key":"S0022481200029054_bib006","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0175782-0"},{"key":"S0022481200029054_bib009","volume-title":"Saturated model theory","author":"Sacks","year":"1972"},{"key":"S0022481200029054_bib008","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215230"},{"key":"S0022481200029054_bib003","volume-title":"Building models by games","author":"Hodges","year":"1985"},{"key":"S0022481200029054_bib004","first-page":"698","volume":"52","author":"Lachlan","year":"1987","journal-title":"Complete theories with only existential and universal axioms"},{"key":"S0022481200029054_bib001","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972700024813"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200029054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T10:37:25Z","timestamp":1679481445000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200029054\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":9,"aliases":["10.1017\/s0022481200029054"],"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["S0022481200029054"],"URL":"https:\/\/doi.org\/10.2307\/2274440","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}