{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:53:35Z","timestamp":1759146815908},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5798,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1016\/s0168-0072(96)00031-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:23:04Z","timestamp":1027657384000},"page":"167-185","source":"Crossref","is-referenced-by-count":16,"title":["A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees"],"prefix":"10.1016","volume":"87","author":[{"given":"Steffen","family":"Lempp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(96)00031-0_BIB1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.2307\/2274050","article-title":"Lattice embeddings into the recursively enumerable degrees","volume":"51","author":"Ambos-Spies","year":"1986","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(96)00031-0_BIB2","doi-asserted-by":"crossref","first-page":"735","DOI":"10.2307\/2274738","article-title":"Lattice embeddings into the recursively enumerable degrees, II","volume":"54","author":"Ambos-Spies","year":"1989","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0168-0072(96)00031-0_BIB3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0168-0072(90)90062-7","article-title":"Lattice non-embeddings and initial segments of the recursively enumerable degrees","volume":"49","author":"Downey","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(96)00031-0_BIB4","first-page":"537","article-title":"Lower bounds for pairs of recursively enumerable degrees","volume":"16","author":"Lachlan","year":"1966"},{"key":"10.1016\/S0168-0072(96)00031-0_BIB5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0001-8708(80)90027-4","article-title":"Not every finite lattice is embeddable in the recursively enumerable degrees","volume":"37","author":"Lachlan","year":"1980","journal-title":"Adv. in Math."},{"key":"10.1016\/S0168-0072(96)00031-0_BIB6","series-title":"Cambridge Summer School in Mathematical Logic, Proceedings","first-page":"311","article-title":"Admissible ordinals and priority arguments","volume":"337","author":"Lerman","year":"1973"},{"key":"10.1016\/S0168-0072(96)00031-0_BIB7","series-title":"Recursion Theory","first-page":"13","article-title":"The embedding problem for the recursively enumerable degrees","volume":"42","author":"Lerman","year":"1985"},{"key":"10.1016\/S0168-0072(96)00031-0_BIB8","series-title":"Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic","author":"Soare","year":"1987"},{"key":"10.1016\/S0168-0072(96)00031-0_BIB9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/malq.19710170131","article-title":"Sublattices of the recursively enumerable degrees","volume":"17","author":"Thomason","year":"1971","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0168-0072(96)00031-0_BIB10","article-title":"On embeddings of the 1-3-1 lattice into the recursively enumerable degrees","author":"Weinstein","year":"1988"},{"key":"10.1016\/S0168-0072(96)00031-0_BIB11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2269807","article-title":"A minimal pair of recursively enumerable degrees","volume":"31","author":"Yates","year":"1966","journal-title":"J. Symbolic Logic"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007296000310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007296000310?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:54:45Z","timestamp":1555066485000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007296000310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0168007296000310"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(96)00031-0","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}