{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T02:54:54Z","timestamp":1688612094803},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":8690,"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":[[1989,10]]},"DOI":"10.1016\/0168-0072(89)90047-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:39:29Z","timestamp":1027654769000},"page":"71-99","source":"Crossref","is-referenced-by-count":16,"title":["Complexity-theoretic algebra II: Boolean algebras"],"prefix":"10.1016","volume":"44","author":[{"given":"A.","family":"Nerode","sequence":"first","affiliation":[]},{"given":"J.B.","family":"Remmel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(89)90047-X_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativisations of the P=?NP Question","volume":"4","author":"Baker","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(89)90047-X_BIB2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NPA \u2260 Co-NPA with probability 1","volume":"10","author":"Bennett","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(89)90047-X_BIB3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0022-0000(78)90034-X","article-title":"On splitting recursive sets","volume":"17","author":"Breidbart","year":"1978","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0168-0072(89)90047-X_BIB4","series-title":"Computer Science Ph.D. Diss.","first-page":"41","article-title":"On some most probable separations of complexity classes","author":"Cai","year":"1986"},{"key":"10.1016\/0168-0072(89)90047-X_BIB5","series-title":"Proc. Inter. Congr for Logic, Methodology, and Philosophy of Science","first-page":"24","article-title":"The intrinsic computational difficulty of functions","author":"Cobham","year":"1964"},{"key":"10.1016\/0168-0072(89)90047-X_BIB6","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971","journal-title":"ACM Symposium on Theory of Computation"},{"key":"10.1016\/0168-0072(89)90047-X_BIB7","year":"1981"},{"key":"10.1016\/0168-0072(89)90047-X_BIB8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1305\/ndjfl\/1093894296","article-title":"Two notes on vector spaces with recursive operations","volume":"12","author":"Dekker","year":"1971","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/0168-0072(89)90047-X_BIB9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math"},{"key":"10.1016\/0168-0072(89)90047-X_BIB10","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0168-0072(89)90047-X_BIB11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(89)90047-X_BIB12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(83)90003-8","article-title":"Oracle dependent properties of the lattice NP-sets","volume":"24","author":"Homer","year":"1983","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0168-0072(89)90047-X_BIB13","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0168-0072(89)90047-X_BIB14","doi-asserted-by":"crossref","first-page":"481","DOI":"10.2307\/2271869","article-title":"Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces","volume":"42","author":"Kalantari","year":"1977","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(89)90047-X_BIB15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","article-title":"Reducibilities among combinatorial problems","author":"Karp","year":"1972","journal-title":"Complexity of Computer Computations"},{"key":"10.1016\/0168-0072(89)90047-X_BIB16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/malq.19660120125","article-title":"Classes of recursively enumerable sets and degrees of unsolvability","volume":"12","author":"Martin","year":"1966","journal-title":"Z. Math. Logik"},{"key":"10.1016\/0168-0072(89)90047-X_BIB17","first-page":"209","article-title":"Recursion Theory and Algebra","volume":"450","author":"Metakides","year":"1975"},{"key":"10.1016\/0168-0072(89)90047-X_BIB18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0003-4843(77)90015-8","article-title":"Recursively enumerable vector spaces","volume":"11","author":"Metakides","year":"1977","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0168-0072(89)90047-X_BIB19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0003-4843(79)90011-1","article-title":"Effective content of field theory","volume":"17","author":"Metakides","year":"1979","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0168-0072(89)90047-X_BIB20","first-page":"323","article-title":"A survey of r.e. substructures","volume":"42","author":"Nerode","year":"1985"},{"key":"10.1016\/0168-0072(89)90047-X_BIB21","series-title":"Proc. Structures in Complexity (second annual conference)","first-page":"218","article-title":"Complexity-theoreticalgebra I: Vector spaces over finite fields","author":"Nerode","year":"1987"},{"key":"10.1016\/0168-0072(89)90047-X_BIB22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0003-4843(78)90027-X","article-title":"Recursively enumerable boolean algebras","volume":"14","author":"Remmel","year":"1978","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0168-0072(89)90047-X_BIB23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0003-4843(80)90016-9","article-title":"Recursion theory on algebraic structures with an independent set","volume":"18","author":"Remmel","year":"1980","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/0168-0072(89)90047-X_BIB24","doi-asserted-by":"crossref","first-page":"20","DOI":"10.2307\/2273351","article-title":"On recursively enumerable and co-recursively enumerable vector spaces with non-extendible bases","volume":"45","author":"Remmel","year":"1980","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(89)90047-X_BIB25","unstructured":"J.B. Remmel, On the lattice of recursively enumerable ideals of a recursive boolean algebra, to appear."},{"key":"10.1016\/0168-0072(89)90047-X_BIB26","article-title":"Complexity and Structure","volume":"211","author":"Schoening","year":"1986"},{"key":"10.1016\/0168-0072(89)90047-X_BIB27","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985","journal-title":"IEEE Symp. on Found. of Computer Science"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800728990047X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800728990047X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:24:27Z","timestamp":1555143867000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800728990047X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["016800728990047X"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(89)90047-x","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}