{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:44:59Z","timestamp":1794339899983,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_27","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"259-269","source":"Crossref","is-referenced-by-count":1,"title":["Unwinding a Non-effective Cut Elimination Proof"],"prefix":"10.1007","author":[{"given":"Grigori","family":"Mints","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"27_CR1","first-page":"461","volume":"21","author":"A. Dragalin","year":"1980","unstructured":"Dragalin, A.: New forms of realizability and Markov\u2019s rule. Soviet Math. Dokl.\u00a021(2), 461\u2013463 (1980)","journal-title":"Soviet Math. Dokl."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Friedman, H.: Classically and intuitionistically provably recursive functions. In: Higher Set Theory, SLNCS, vol.\u00a0699, pp. 21\u201328 (1978)","DOI":"10.1007\/BFb0103100"},{"key":"27_CR3","volume-title":"Proof Theory and Logical Complexity","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Proof Theory and Logical Complexity, vol.\u00a01. Bibliopolis, Naples (1987)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Hilbert, D., Bernays, P.: Grundlagen der Mathematik, Bd. 2. Springer, Heidelberg (1970)","DOI":"10.1007\/978-3-642-86896-2"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1090\/S0002-9947-04-03515-9","volume":"357","author":"U. Kohlenbach","year":"2005","unstructured":"Kohlenbach, U.: Some logical metatheorems with applications to functional analysis. Trans. Amer. Math. Soc.\u00a0357(1), 89\u2013128 (2005)","journal-title":"Trans. Amer. Math. Soc."},{"key":"27_CR6","first-page":"241","volume":"16","author":"G. Kreisel","year":"1951","unstructured":"Kreisel, G.: On the Interpretation of Non-finitist Proofs I. J. Symbolic Logic\u00a016, 241\u2013267 (1951)","journal-title":"J. Symbolic Logic"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2307\/2267457","volume":"17","author":"G. Kreisel","year":"1952","unstructured":"Kreisel, G.: On the Interpretation of Non-finitist Proofs II. J. Symbolic Logic\u00a017, 43\u201358 (1952)","journal-title":"J. Symbolic Logic"},{"key":"27_CR8","first-page":"205","volume-title":"Logic and Computer Science","author":"G. Kreisel","year":"1990","unstructured":"Kreisel, G.: Logical Aspects of Computations: Contributions and Distractions. In: Odifreddi, P. (ed.) Logic and Computer Science, pp. 205\u2013278. Academic Press, London (1990)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Kreisel, G., Mints, G., Simpson, S.: The Use of Abstract Language in Elementary Metamathematics. Lecture Notes in Mathematics, vol.\u00a0253, pp. 38\u2013131 (1975)","DOI":"10.1007\/BFb0064871"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF01091552","volume":"8","author":"G. Mints","year":"1977","unstructured":"Mints, G.: E-theorems. J. Soviet Math.\u00a08(3), 323\u2013329 (1977)","journal-title":"J. Soviet Math."},{"key":"27_CR11","first-page":"527","volume":"14","author":"G. Mints","year":"1976","unstructured":"Mints, G.: The Universality of the Canonical Tree. Soviet Math. Dokl.\u00a014, 527\u2013532 (1976)","journal-title":"Soviet Math. Dokl."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Schwichtenberg, H., Buchholz, W.: Refined program extraction from classical proofs. Annals of Pure and Applied Logic\u00a0114 (2002)","DOI":"10.1016\/S0168-0072(01)00073-2"},{"key":"27_CR13","volume-title":"Mathematical Logic","author":"J. Shoenfield","year":"1967","unstructured":"Shoenfield, J.: Mathematical Logic. Addison-Vesley, Reading (1967)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:35Z","timestamp":1619492615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11753728_27","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}