{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:21:31Z","timestamp":1737091291818,"version":"3.33.0"},"reference-count":16,"publisher":"Wiley","issue":"19-24","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.19860321912","type":"journal-article","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T23:45:01Z","timestamp":1180395901000},"page":"377-384","source":"Crossref","is-referenced-by-count":4,"title":["A G\u00f6del Theorem on Network Complexity Lower Bounds"],"prefix":"10.1002","volume":"32","author":[{"given":"C. P.","family":"Schnorr","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","first-page":"1","article-title":"Begr\u00fcndung des \u201ctertium non datur\u201d mittels der Hilbertschen Theorie der Widerspruchsfreiheit","volume":"83","author":"Ackermann W.","year":"1924","journal-title":"Math. Ann"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"Blum N. A Boolean function requiring 3n network size.Theor. Comp. Sci.(1984) 337\u2013345.","DOI":"10.1016\/0304-3975(83)90029-4"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"Cook S. A. The complexity of theorem proving procedures. Proceedings of 3rd ACM Symp. on Theory of Computing (1974) 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"Cook S. A. Feasibility constructive proofs and the propositional calculus. Proceedings of 7thACM Symp. on Theory of Computing(1975) 83\u201397.","DOI":"10.1145\/800116.803756"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"Cook S. A. andR.Reckhow On the length of proofs in the propositional calculus.Proceedings of 6th ACM Symp. on Theory of Computing(1974) 135\u2013148.","DOI":"10.1145\/1008311.1008313"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"DeMillo R. A. andR. J.Lipton The consistency of \u201cP = NP\u201d and related problems with fragments of number theory.Proceedings of 12th ACM Symp. on Theory of Computing(1980) 45\u201357.","DOI":"10.1145\/800141.804652"},{"key":"e_1_2_1_8_2","unstructured":"Feege G. Begriffsschrift eine der arithmetischen nachgebildeten Formelsprache des reinen Denkens. Halle1879."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_10_2","first-page":"115","article-title":"Universal sequential search problems","volume":"9","author":"Levin L. A.","year":"1973","journal-title":"Problemy Pereda\u010di Informacii"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"Meyer A. R. andL. J.Stockmeyer The equivalence problem for regular experssions with squaring requires exponential space.Proceedings of 13th IEEE Symp. on Switching and Automata Theory(1972) 125\u2013129.","DOI":"10.1109\/SWAT.1972.29"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206030"},{"key":"e_1_2_1_13_2","unstructured":"Peano G. Arithmetices principia nova methode exposita. Turin1889."},{"volume-title":"The complexity of computing","year":"1976","author":"Savage J.","key":"e_1_2_1_14_2"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02246615"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90074-2"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"Stockmeyer L. J. andA. R.Meyer Word problems requiring exponential time.Proceedings of 5th ACM Symp. on Theory of Computing(1973) 1\u20139.","DOI":"10.1145\/800125.804029"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19860321912","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19860321912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:47:27Z","timestamp":1737053247000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19860321912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":16,"journal-issue":{"issue":"19-24","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["10.1002\/malq.19860321912"],"URL":"https:\/\/doi.org\/10.1002\/malq.19860321912","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"type":"print","value":"0942-5616"},{"type":"electronic","value":"1521-3870"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}