{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:54Z","timestamp":1759638534891},"reference-count":53,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":6225,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0304-3975(95)00146-8","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"263-287","source":"Crossref","is-referenced-by-count":1,"title":["Index sets and presentations of complexity classes"],"prefix":"10.1016","volume":"161","author":[{"given":"Kenneth W.","family":"Regan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00146-8_BIB1","series-title":"Proc. 35th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"807","article-title":"Measure on small complexity classes, with applications for BPP","author":"Allender","year":"1994"},{"key":"10.1016\/0304-3975(95)00146-8_BIB2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(87)90053-3","article-title":"Diagonalizations over polynomial computable sets","volume":"51","author":"Ambos-Spies","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB3_1","series-title":"Proc. 1st Workshop on Computer Science Logic","first-page":"1","article-title":"Diagonalizing over deterministic polynomial time","volume":"Vol. 329","author":"Ambos-Spies","year":"1988"},{"key":"10.1016\/0304-3975(95)00146-8_BIB3_2","unstructured":"A full version is Forschungsbericht No. 1\/88, Fachbereich Informatik der Universit\u00e4t Oldenburg."},{"key":"10.1016\/0304-3975(95)00146-8_BIB4","series-title":"Proc. 19th Internat. Symp. on Mathematical Foundations of Computer Science","first-page":"221","article-title":"Genericity and measure for exponential time","volume":"Vol. 841","author":"Ambos-Spies","year":"1994"},{"key":"10.1016\/0304-3975(95)00146-8_BIB5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01776574","article-title":"On \u2018provable\u2019 analogs of P and NP","volume":"12","author":"Baker","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00146-8_BIB6","series-title":"Structural Complexity Theory","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0304-3975(95)00146-8_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","article-title":"Bi-immune sets for complexity classes","volume":"18","author":"Balc\u00e1zar","year":"1985","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00146-8_BIB8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00146-8_BIB9","series-title":"Computability and Logic","author":"Boolos","year":"1974"},{"key":"10.1016\/0304-3975(95)00146-8_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0019-9958(86)80034-1","article-title":"The position of index sets of identifiable sets in the arithmetical hierarchy","volume":"68","author":"Brandt","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00146-8_BIB11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0168-0072(88)90023-1","article-title":"Index sets in the arithmetical hierarchy","volume":"37","author":"Brandt","year":"1988","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(95)00146-8_BIB12","series-title":"Proc. 21st Ann. Internat. Conf. on Automata, Languages, and Programming","first-page":"263","article-title":"On the cutting edge of relativization: the resource-bounded injury method","volume":"Vol. 820","author":"Buhrman","year":"1994"},{"key":"10.1016\/0304-3975(95)00146-8_BIB13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0022-0000(81)90021-0","article-title":"A note on structure and looking-back applied to the relative complexity of computable functions","volume":"22","author":"Chew","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB14","series-title":"Proc. 12th Ann. ACM Symp. on the Theory of Computing","first-page":"45","article-title":"The consistency of \u201cP = NP\u201d and related problems with fragments of number theory","author":"DeMillo","year":"1980"},{"key":"10.1016\/0304-3975(95)00146-8_BIB15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/322358.322370","article-title":"The expressiveness of simple and second-order type structures","volume":"30","author":"Fortune","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00146-8_BIB16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(79)90046-X","article-title":"Arithmetical hierarchy and complexity of computation","volume":"8","author":"H\u00e1jek","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB17","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0022-0000(71)80007-7","article-title":"The use of lists in the study of undecidable problems in automata theory","volume":"5","author":"Hartmanis","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.2307\/2270979","article-title":"Index sets of finite classes of recursively enumerable sets","volume":"34","author":"Hay","year":"1969","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(95)00146-8_BIB19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/malq.19740201309","article-title":"Index sets universal for differences of arithmetic sets","volume":"20","author":"Hay","year":"1974","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(95)00146-8_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(86)80041-9","article-title":"Arithmetic theories for computational complexity problems","volume":"69","author":"Homer","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00146-8_BIB21","first-page":"104","article-title":"A survey of some recent results on computational complexity in weak theories of arithmetic","volume":"8","author":"Joseph","year":"1985","journal-title":"Fundamenta Informatica"},{"key":"10.1016\/0304-3975(95)00146-8_BIB22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1090\/S0002-9947-1943-0007371-8","article-title":"Recursive predicates and quantifiers","volume":"53","author":"Kleene","year":"1943","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(95)00146-8_BIB23","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/malq.19760220131","article-title":"Indexmengen und Erkennung rekursiver Funktionen","volume":"22","author":"Klette","year":"1976","journal-title":"Z. Math. Logik Grundlag Math."},{"key":"10.1016\/0304-3975(95)00146-8_BIB24","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1137\/0218027","article-title":"Relativized polynomial time hierarchies having exactly k levels","volume":"18","author":"Ko","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00146-8_BIB25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(87)90191-8","article-title":"How to prove representation-independent independence results","volume":"24","author":"Kurtz","year":"1987","journal-title":"Inform Process. Lett."},{"key":"10.1016\/0304-3975(95)00146-8_BIB26","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(81)90069-4","article-title":"On the structure of sets in NP and other complexity classes","volume":"15","author":"Landweber","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB27","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/321694.321702","article-title":"Recursive properties of abstract complexity classes","volume":"19","author":"Landweber","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00146-8_BIB28","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-3975(82)90068-8","article-title":"Unprovability of theorems of complexity theory in weak number theories","volume":"18","author":"Leivant","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB29","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/malq.19710170134","article-title":"Classes of recursive functions and their index sets","volume":"17","author":"Lewis","year":"1971","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0304-3975(95)00146-8_BIB30","series-title":"Proc. 19th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"191","article-title":"Model-theoretic aspects of computational complexity","author":"Lipton","year":"1978"},{"key":"10.1016\/0304-3975(95)00146-8_BIB31","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(92)90020-J","article-title":"Almost everywhere high nonuniform complexity","volume":"44","author":"Lutz","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB32","series-title":"Proc. 8th Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"158","article-title":"The quantitative structure of exponential time","author":"Lutz","year":"1993"},{"key":"10.1016\/0304-3975(95)00146-8_BIB33","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/0304-3975(95)00146-8_BIB34","series-title":"Logic, Methodology, and Philosophy of Science IV","article-title":"On recursive unsolvability of Hilbert's tenth problem","author":"Matijasevic","year":"1973"},{"key":"10.1016\/0304-3975(95)00146-8_BIB35","doi-asserted-by":"crossref","first-page":"521","DOI":"10.4064\/aa-27-1-521-553","article-title":"Reduction of an arbitrary Diophantine equation to one in 13 unknowns","volume":"27","author":"Matijasevic","year":"1975","journal-title":"Acta Arithmetica"},{"key":"10.1016\/0304-3975(95)00146-8_BIB36","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","article-title":"Hardness versus randomness","volume":"49","author":"Nisan","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB37","series-title":"Proc. 11th Ann. ACM Symp. on the Theory of Computing","first-page":"176","article-title":"A programming language theorem which is independent of Peano arithmetic","author":"O'Donnell","year":"1979"},{"key":"10.1016\/0304-3975(95)00146-8_BIB38","series-title":"Proc. Logic and Machines","first-page":"118","article-title":"Arithmetical degrees of index sets for complexity classes","volume":"Vol. 171","author":"Regan","year":"1984"},{"key":"10.1016\/0304-3975(95)00146-8_BIB39","article-title":"On the separation of complexity classes","author":"Regan","year":"1986"},{"key":"10.1016\/0304-3975(95)00146-8_BIB40","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0022-0000(88)90036-0","article-title":"The topology of provability in complexity theory","volume":"3","author":"Regan","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90040-M","article-title":"Diagonalization, uniformity, and fixed-point theorems","volume":"98","author":"Regan","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00146-8_BIB42","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01342939","article-title":"Computing degrees of unsolvability","volume":"138","author":"Rogers","year":"1959","journal-title":"Math. Ann."},{"key":"10.1016\/0304-3975(95)00146-8_BIB43","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(95)00146-8_BIB44","article-title":"Degrees of Unsolvability","volume":"Vol. 55","author":"Sacks","year":"1963"},{"key":"10.1016\/0304-3975(95)00146-8_BIB45","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(85)90217-8","article-title":"The recursion-theoretic structure of complexity classes","volume":"38","author":"Schmidt","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB46","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(82)90114-1","article-title":"A uniform approach to obtain diagonal sets in complexity classes","volume":"18","author":"Sch\u00f6ning","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB47","series-title":"Logical Number Theory I: An Introduction","author":"Smory\u0144ski","year":"1991"},{"key":"10.1016\/0304-3975(95)00146-8_BIB48","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/0304-3975(95)00146-8_BIB49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB50","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00146-8_BIB51","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1090\/S0002-9947-1966-0184855-9","article-title":"On the degrees of index sets","volume":"121","author":"Yates","year":"1966","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(95)00146-8_BIB52","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1090\/S0002-9947-1969-0241295-4","article-title":"On the degrees of index sets II","volume":"135","author":"Yates","year":"1969","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001468?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001468?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:53:31Z","timestamp":1555419211000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":53,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0304397595001468"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00146-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}