{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:23Z","timestamp":1725664403675},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601784"},{"type":"electronic","value":"9783540447207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60178-3_89","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:48:44Z","timestamp":1330278524000},"page":"269-280","source":"Crossref","is-referenced-by-count":0,"title":["Type 2 polynomial hierarchies"],"prefix":"10.1007","author":[{"given":"Anil","family":"Seth","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Balcazar, Diaz, and Gabarro. Structural Complexity I. Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-97062-7"},{"key":"14_CR2","volume-title":"Bounded Arithmetic","author":"S. Buss","year":"1986","unstructured":"S. Buss. Bounded Arithmetic. Bibliopolis, Naples, 1986."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"S. Buss. The polynomial hierarchy and intuitionistic bounded arithmetic. In Structure in Complexity Theory, pages 77\u2013103. Springer-Verlag, Lecture Notes in Computer Science No. 223, 1986.","DOI":"10.1007\/3-540-16486-3_91"},{"key":"14_CR4","unstructured":"P. Clote, A. Ignjatovic, and B. Kapron. Parallel computable higher type functional. In Full version, July 1994."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0168-0072(93)90044-E","volume":"63","author":"S. Cook","year":"1993","unstructured":"S. Cook and A. Urquhart. Functional interpretations of feasibly constructive arithmetic. Annals of Pure and Applied Logic, pages 103\u2013200, Volume 63, 1993. Extended abstract in STOC89.","journal-title":"Annals of Pure and Applied Logic"},{"key":"14_CR6","first-page":"71","volume-title":"perespective in computer science","author":"S. A. Cook","year":"1990","unstructured":"S. A. Cook and B. M. Kapron. Characterizations of the basic feasible functional of finite type. In Proceedings of MSI Workshop on Feasible Mathematics, S. Buss and P. J. Scott, {ededitors}, perespective in computer science, Birkhauser-Boston, New York, pages 71\u201395, 1990."},{"key":"14_CR7","unstructured":"S. A. Cook and B. M. Kapron. A new characterization of Mehlhorn's polynomial time functionals. In FOCS, 1991."},{"key":"14_CR8","unstructured":"Stephen A. Cook. Computability and complexity of higher type functions. In MSRI Proceedings, 1990."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Victor Harnik. Provably total functions of intuitionistic bounded arithmetic. Journal of Symbolic Logic, pages 466\u2013477, 1992.","DOI":"10.2307\/2275282"},{"key":"14_CR10","unstructured":"A. Seth. There is no recursive axiomatization for feasible functionals of type 2. In Seventh Annual IEEE Symposium on Logic in Computer Science, 1992."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"A. Seth. Some desirable conditions for feasible functional of type 2. In Eighth Annual IEEE Symposium on Logic in Computer Science, 1993.","DOI":"10.1109\/LICS.1993.287576"},{"key":"14_CR12","volume-title":"perespective in computer science","author":"A. Seth","year":"1994","unstructured":"A. Seth. Turing machine characterizations of feasible functionals of all finite types. In Proceedings of MSI Workshop on Feasible Mathematics, P. Clote and J. Remmel, editors, perespective in computer science, Birkhauser-Boston, New York, 1994."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"L. J. Stockmeyer. The polynomial time hierarchy. Theoretical Computer Science, pages 1\u201322, 1976.","DOI":"10.1016\/0304-3975(76)90061-X"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"M. Townsend. Complexity for type-2 relations. Notre Dame Journal of Formal Logic, pages 241\u2013262, 1990.","DOI":"10.1305\/ndjfl\/1093635419"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"A. Yao. Separating the polynomial-time hierarchy by oracles. In IEEE Symposium on Fondations of Computer Science, 1985.","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Lecture Notes in Computer Science","Logic and Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60178-3_89.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:47Z","timestamp":1605646547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60178-3_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601784","9783540447207"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60178-3_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}