{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:40:01Z","timestamp":1706650801717},"reference-count":14,"publisher":"Duke University Press","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[1997,7,1]]},"DOI":"10.1305\/ndjfl\/1039700747","type":"journal-article","created":{"date-parts":[[2003,2,25]],"date-time":"2003-02-25T21:01:33Z","timestamp":1046206893000},"source":"Crossref","is-referenced-by-count":0,"title":["Infima in the Recursively Enumerable Weak Truth Table Degrees"],"prefix":"10.1215","volume":"38","author":[{"given":"Rich","family":"Blaylock","sequence":"first","affiliation":[]},{"given":"Rod","family":"Downey","sequence":"additional","affiliation":[]},{"given":"Steffen","family":"Lempp","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"Ambos-Spies, K., \u201cContiguous r.e. degrees,\u201d pp. 1\u201337 in <i>Computation and Proof Theory, Lecture Notes in Mathematics<\/i>, 1104, edited by M. M. Richter et al., Springer-Verlag, New York, 1984. Zbl 0562.03022 MR 86f:03065","DOI":"10.1007\/BFb0099477"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Ambos-Spies, K., \u201cOn pairs of recursively enumerable degrees,\u201d <i>Transactions of the American Mathematical Society<\/i>, vol. 283 (1984), pp. 507\u201331. Zbl 0541.03023 MR 85d:03083","DOI":"10.1090\/S0002-9947-1984-0737882-5"},{"key":"3","doi-asserted-by":"crossref","unstructured":"Ambos-Spies, K., \u201cCupping and noncapping in the r.e. weak truth table and Turing degrees,\u201d <i>Archiv f\u00fcr mathematische Logik und Grundlagenforschung<\/i>, vol. 25 (1985), pp. 109\u201326. Zbl 0619.03032 MR 87j:03058","DOI":"10.1007\/BF02007561"},{"key":"4","unstructured":"Blaylock, R., <i>Some Results on e-Genericity and Recursively Enumerable Weak Truth Table Degrees<\/i>, Ph.D. Dissertation, University of Illinois at Urbana-Champaign, 1991."},{"key":"5","unstructured":"Cohen, P. F., <i>Weak Truth-Table Reducibility and the Pointwise Ordering of 1-1 Recursive Functions<\/i>, Ph.D. Dissertation, University of Illinois at Urbana-Champaign, 1975."},{"key":"6","doi-asserted-by":"crossref","unstructured":"Downey, R. G., \u201c$\\Delta_2^0$ degrees and transfer theorems,\u201d <i>Illinois Journal of Mathematics,<\/i> vol. 31 (1987), pp. 419\u201327. Zbl 0629.03017 MR 89c:03070","DOI":"10.1215\/ijm\/1256069291"},{"key":"7","doi-asserted-by":"crossref","unstructured":"Fischer, P., \u201cPairs without infimum in the recursively enumerable weak truth table degrees,\u201d <i>The Journal of Symbolic Logic<\/i>, vol. 51 (1986), pp. 117\u201329. Zbl 0587.03030 MR 87g:03044","DOI":"10.2307\/2273948"},{"key":"8","doi-asserted-by":"crossref","unstructured":"Friedberg, R. M., and H. Rogers, Jr. \u201cReducibility and completeness for sets of integers,\u201d <i>Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 5 (1959), pp. 117\u201325. Zbl 0108.00602 MR 22:3682","DOI":"10.1002\/malq.19590050703"},{"key":"9","doi-asserted-by":"crossref","unstructured":"Jockusch, Jr., C. G., \u201cThree easy constructions of recursively enumerable sets,\u201d pp. 83\u201391 in <i>Logic Year 1979\u201380, Lecture Notes in Mathematics<\/i>, 859, edited by M. Lerman, J. Schmerl, and R. Soare, Springer-Verlag, New York, 1981. Zbl 0472.03031 MR 83a:03036","DOI":"10.1007\/BFb0090941"},{"key":"10","doi-asserted-by":"crossref","unstructured":"Lachlan, A. H., \u201cLower bounds for pairs of recursively enumerable degrees,\u201d <i>Proceedings of the London Mathematical Society<\/i>, vol. 16 (1966), pp. 537\u201369. Zbl 0156.00907 MR 34:4126","DOI":"10.1112\/plms\/s3-16.1.537"},{"key":"11","doi-asserted-by":"crossref","unstructured":"Ladner, R. E., and L. P. Sasso, \u201cThe weak truth table degrees of recursively enumerable sets,\u201d <i>Annals of Mathematical Logic<\/i>, vol. 8 (1975), pp. 429\u201348. Zbl 0324.02028 MR 52:63","DOI":"10.1016\/0003-4843(75)90007-8"},{"key":"12","doi-asserted-by":"crossref","unstructured":"Soare, R. I., <i>Recursively Enumerable Sets and Degrees<\/i>, Springer-Verlag, New York, 1987. Zbl 0623.03042 MR 88m:03003","DOI":"10.1007\/978-3-662-02460-7"},{"key":"13","doi-asserted-by":"crossref","unstructured":"Stob, M., \u201cwtt-degrees and T-degrees of recursively enumerable sets,\u201d <i>The Journal of Symbolic Logic,<\/i> vol. 48 (1983), pp. 921\u201330.","DOI":"10.2307\/2273658"},{"key":"14","doi-asserted-by":"crossref","unstructured":"Yates, C. E. M., \u201cA minimal pair of recursively enumerable degrees,\u201d <i>The Journal of Symbolic Logic,<\/i> vol. 32 (1965), pp. 159\u201368. Zbl 0143.25402 MR 34:5677","DOI":"10.2307\/2269807"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1039700747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:13:09Z","timestamp":1706649189000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-38\/issue-3\/Infima-in-the-Recursively-Enumerable-Weak-Truth-Table-Degrees\/10.1305\/ndjfl\/1039700747.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7,1]]},"references-count":14,"journal-issue":{"issue":"3","published-online":{"date-parts":[[1997,7,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1039700747","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7,1]]}}}