{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T07:43:57Z","timestamp":1775807037856,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":8052,"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":[[1991,7]]},"DOI":"10.1016\/0168-0072(91)90059-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"75-102","source":"Crossref","is-referenced-by-count":50,"title":["The undecidability of k-provability"],"prefix":"10.1016","volume":"53","author":[{"given":"Samuel","family":"R. Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(91)90059-U_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0168-0072(91)90015-E","article-title":"A unification-theoretic method for investigating the k-provability problem","volume":"51","author":"Farmer","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(91)90059-U_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0168-0072(88)90015-2","article-title":"A unification algorithm for second-order monadic terms","volume":"39","author":"Farmer","year":"1988","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(91)90059-U_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(91)90059-U_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","article-title":"The undecidability of the second-order unification problem","volume":"13","author":"Goldfarb","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0168-0072(91)90059-U_BIB5","first-page":"82","author":"Kraj\u00ed\u010dek","year":"1987"},{"key":"10.1016\/0168-0072(91)90059-U_BIB6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01625836","article-title":"The number of proof lines and the size of proofs in first-order logic","volume":"27","author":"Kraj\u00ed\u010dek","year":"1988","journal-title":"Arch. Math. Logic"},{"key":"10.1016\/0168-0072(91)90059-U_BIB7","unstructured":"G. Kreisel, Proof theory: some personal recollections, Appendix to [13]"},{"key":"10.1016\/0168-0072(91)90059-U_BIB8","first-page":"81","article-title":"On the length of proofs in a formal system of recursive arithmetic, Logic Symposia, Hakone","volume":"891","author":"Miyatake","year":"1980"},{"key":"10.1016\/0168-0072(91)90059-U_BIB9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.21099\/tkbjm\/1496158798","article-title":"On the length of proofs in formal systems","volume":"4","author":"Miyatake","year":"1980","journal-title":"Tsukuba J. Math."},{"key":"10.1016\/0168-0072(91)90059-U_BIB10","first-page":"326","article-title":"Reconstruction of a proof form its scheme","volume":"35","author":"Orevkov","year":"1987","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0168-0072(91)90059-U_BIB11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1090\/S0002-9947-1973-0432416-X","article-title":"Some results on the lengths of proofs","volume":"177","author":"Parijh","year":"1973","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(91)90059-U_BIB12","doi-asserted-by":"crossref","first-page":"235","DOI":"10.2307\/2272636","article-title":"Sets of theorems with short proofs","volume":"39","author":"Richardson","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(91)90059-U_BIB13","author":"Takeuti","year":"1987"},{"key":"10.1016\/0168-0072(91)90059-U_BIB14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.21099\/tkbjm\/1496158386","article-title":"A theorem on the formalized arithmetic with function symbols ' and +","volume":"1","author":"Yukami","year":"1977","journal-title":"Tsukuba J. Math."},{"key":"10.1016\/0168-0072(91)90059-U_BIB15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.21099\/tkbjm\/1496158505","article-title":"A note on a formalized arithmetic with function symbols ' and +","volume":"2","author":"Yukami","year":"1978","journal-title":"Tsukuba J. Math."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190059U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729190059U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:52:58Z","timestamp":1555141978000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729190059U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["016800729190059U"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(91)90059-u","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}