{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T01:11:55Z","timestamp":1782263515563,"version":"3.54.5"},"publisher-location":"Berlin\/Heidelberg","reference-count":5,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540133720","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030318","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:19:29Z","timestamp":1138184369000},"page":"364-369","source":"Crossref","is-referenced-by-count":12,"title":["Some connections between presentability of complexity classes and the power of formal systems of reasoning"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Kowalczyk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1008335.1008336","volume":"8","author":"J. Hartmanis","year":"1976","unstructured":"Hartmanis, J. and Hopcroft, J., Independence results in computer science, SIGACT News, vol. 8, no. 4 \/1976\/ pp. 13\u201324.","journal-title":"SIGACT News"},{"key":"33_CR2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(79)90047-1","volume":"8","author":"J. Hartmanis","year":"1979","unstructured":"Hartmanis, J., Relations between diagonalization, proof systems, and complexity gaps, Theoretical Computer Science 8 \/1979\/ 239\u2013253.","journal-title":"Theoretical Computer Science"},{"key":"33_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(81)90069-4","volume":"15","author":"L. Landweber","year":"1981","unstructured":"Landweber, L., Lipton, R., and Robertson, E., On the structure of sets in NP and other complexity classes, Theoretical Computer Science 15 \/1981\/ 181\u2013200.","journal-title":"Theoretical Computer Science"},{"key":"33_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(82)90114-1","volume":"18","author":"U. Sch\u00f6ning","year":"1982","unstructured":"Sch\u00f6ning, U., A uniform approach to obtain diagonal sets in complexity classes, Theoretical Computer Science 18 \/1982\/ 95\u2013103.","journal-title":"Theoretical Computer Science"},{"key":"33_CR5","volume-title":"On relativization and the existence of complete sets","author":"M. Sipser","year":"1982","unstructured":"Sipser, M., On relativization and the existence of complete sets, 9th International Colloquium on Automata, Languages and Programing, Springer-Verlag, 1982."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1984"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030318.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:01:04Z","timestamp":1607533264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540133720"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0030318","relation":{},"subject":[]}}