{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:18:26Z","timestamp":1778296706644,"version":"3.51.4"},"reference-count":13,"publisher":"Wiley","issue":"17-18","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":7621,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1002\/malq.19860321702","type":"journal-article","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T23:46:10Z","timestamp":1180395970000},"page":"257-270","source":"Crossref","is-referenced-by-count":9,"title":["Oracle\u2010Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP"],"prefix":"10.1002","volume":"32","author":[{"given":"Gerhard","family":"Lischke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"e_1_2_1_3_2","first-page":"296","volume-title":"Proc. Frege Conference 1984, Schwerin","author":"Book R. V.","year":"1984"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0211048"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_2_1_6_2","first-page":"45","volume-title":"Mathematical Foundations of Computer Science, Proc. Gdansk 1976","author":"Dekhtyar M. I.","year":"1976"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80058-8"},{"key":"e_1_2_1_8_2","first-page":"83","volume-title":"Sparse sets in NP\u2010P: EXPTIME versus NEXPTIME. Department of Computer Science","author":"Hartmanis J.","year":"1983"},{"key":"e_1_2_1_9_2","volume-title":"Formal languages and their relation to automata","author":"Hopcroft J.","year":"1969"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683260"},{"key":"e_1_2_1_11_2","article-title":"Relativizations of NP and EL, strongly separating, and sparse sets","author":"Lischke G.","journal-title":"Elektron. Informationsverarb. Kybernetik."},{"key":"e_1_2_1_12_2","volume-title":"Computational complexity","author":"Wagner K."},{"key":"e_1_2_1_12_3","volume-title":"Computational complexity","year":"1986"},{"key":"e_1_2_1_13_2","unstructured":"Wilson C. B. Relativization reducibilities and the exponential hierarchy. M. S. thesis University of Toronto Toronto 1980."}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19860321702","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19860321702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T04:18:24Z","timestamp":1693455504000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19860321702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":13,"journal-issue":{"issue":"17-18","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["10.1002\/malq.19860321702"],"URL":"https:\/\/doi.org\/10.1002\/malq.19860321702","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}