{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:10:31Z","timestamp":1706649031875},"reference-count":21,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2007,4,1]]},"DOI":"10.1305\/ndjfl\/1179323263","type":"journal-article","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T00:43:24Z","timestamp":1195173804000},"source":"Crossref","is-referenced-by-count":2,"title":["On the Symmetric Enumeration Degrees"],"prefix":"10.1215","volume":"48","author":[{"given":"Charles M.","family":"Harris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Arslanov, M. M., I. S. Kalimullin, and S. B. Cooper, \"Splitting properties of total enumeration degrees\", <i>Algebra and Logic<\/i>, vol. 42 (2003), pp. 1--13.","DOI":"10.1023\/A:1022660222520"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Ershov, Y. L., \"A certain hierarchy of sets. III\", <i>Algebra i Logika<\/i>, vol. 9 (1970), pp. 34--51. Reprinted in <i>Algebra and Logic<\/i>, vol. 9 (1970), pp. 20--31.","DOI":"10.1007\/BF02219847"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Harris, C., \"Symmetric enumeration reducibility\", pp. 196--208 in <i>New Computational Paradigms: First Conference on Computablitiy in Europe, CiE 2005, Amsterdam<\/i>, edited by S. B. Cooper and B. L\u00f6we, vol. 3526 of <i>Lecture Notes in Computer Science<\/i>, Springer, 2005.","DOI":"10.1007\/11494645_24"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Jockusch, C. G., Jr., \"Semirecursive sets and positive reducibility\", <i>Transactions of the American Mathematical Society<\/i>, vol. 131 (1968), pp. 420--36.","DOI":"10.2307\/1994957"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Kalimullin, I. S., \"Definability of the jump operator in the enumeration degrees\", <i>Journal of Mathematical Logic<\/i>, vol. 3 (2003), pp. 257--67.","DOI":"10.1142\/S0219061303000285"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Kleene, S. C., and E. L. Post, \"The upper semi-lattice of degrees of recursive unsolvability\", <i>Annals of Mathematics. Second Series<\/i>, vol. 59 (1954), pp. 379--407.","DOI":"10.2307\/1969708"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Lachlan, A. H., \"Lower bounds for pairs of recursively enumerable degrees\", <i>Proceedings of the London Mathematical Society. Third Series<\/i>, vol. 16 (1966), pp. 537--69.","DOI":"10.1112\/plms\/s3-16.1.537"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Lachlan, A. H., \"Embedding nondistributive lattices in the recursively enumerable degrees\", pp. 149--77 in <i>Conference in Mathematical Logic-London, 1970<\/i>, edited by W. Hodges, vol. 255 of <i>Springer Lecture Notes in Mathematics<\/i>, Springer, Berlin, 1972.","DOI":"10.1007\/BFb0059544"},{"key":"9","unstructured":"[9] Lacombe, D., \"Sur le semi-r\u00e9seau constitu\u00e9 par les degr\u00e9s d'ind\u00e9cidabilit\u00e9 r\u00e9cursive\", <i>Comptes Rendus Hebdomadaires des S\u00e9ances de l'Acad\u00e9mie des Sciences (Paris)<\/i>, vol. Series A-B 239 (1954), pp. 1108--9."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Lerman, M., \"On suborderings of the $\\alpha $\"-recursively enumerable $\\alpha $-degrees, <i>Annals of Pure and Applied Logic<\/i>, vol. 4 (1972), pp. 369--92.","DOI":"10.1016\/0003-4843(72)90005-8"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] McEvoy, K., \"Jumps of quasi-minimal enumeration degrees\", <i>The Journal of Symbolic Logic<\/i>, vol. 50 (1985), pp. 839--48.","DOI":"10.2307\/2274335"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] McEvoy, K., and S. B. Cooper, \"On minimal pairs of enumeration degrees\", <i>The Journal of Symbolic Logic<\/i>, vol. 50 (1985), pp. 983--1001.","DOI":"10.2307\/2273985"},{"key":"13","unstructured":"[13] Medvedev, Y. T., \"On nonisomorphic recursively enumerable sets\", <i>Doklady Akademii Nauk SSSR<\/i>, vol. 102 (1955), pp. 211--14."},{"key":"15","unstructured":"[15] Rozinas, M. G., \"The semilattice of e-degrees\", pp. 71--84 in <i>Recursive Functions (Russian)<\/i>, edited by E. A. Polyakov, Ivanovskij Gosudarstvennyj Universitet, Ivanovo, 1978."},{"key":"16","unstructured":"[16] Sacks, G. E., <i>Degrees of Unsolvability<\/i>, Princeton University Press, Princeton, 1963."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Sacks, G. E., \"The recursively enumerable degrees are dense\", <i>Annals of Mathematics. Second Series<\/i>, vol. 80 (1964), pp. 300--312.","DOI":"10.2307\/1970393"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] Selman, A. L., \"Arithmetical reducibilities. II\", <i>Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 18 (1972), pp. 83--92.","DOI":"10.1002\/malq.19720180406"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] Simpson, S. G., \"First-order theory of the degrees of recursive unsolvability\", <i>Annals of Mathematics. Second Series<\/i>, vol. 105 (1977), pp. 121--39.","DOI":"10.2307\/1971028"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] Spector, C., \"On degrees of recursive unsolvability\", <i>Annals of Mathematics. Second Series<\/i>, vol. 64 (1956), pp. 581--92.","DOI":"10.2307\/1969604"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] Yates, C. E. M., \"A minimal pair of recursively enumerable degrees\", <i>The Journal of Symbolic Logic<\/i>, vol. 31 (1966), pp. 159--68.","DOI":"10.2307\/2269807"},{"key":"14","unstructured":"[14] Odifreddi, P. G., <i>Classical Recursion Theory. Vol. II<\/i>, vol. 143 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland Publishing Co., Amsterdam, 1999."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1179323263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:56:55Z","timestamp":1706648215000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-48\/issue-2\/On-the-Symmetric-Enumeration-Degrees\/10.1305\/ndjfl\/1179323263.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,1]]},"references-count":21,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2007,4,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1179323263","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2007,4,1]]}}}