{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:43Z","timestamp":1725495763747},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76637-7_18","type":"book-chapter","created":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T02:47:52Z","timestamp":1195526872000},"page":"271-285","source":"Crossref","is-referenced-by-count":4,"title":["Positive Arithmetic Without Exchange Is a Subclassical Logic"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Berardi","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Tatsuta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Akama, Y., Berardi, S., Hayashi, S., Kohlenbach, U.: An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles. In: Proceedings of Nineteenth Annual IEEE Symposium on Logic in Computer Science, pp. 192\u2013201 (2004)","key":"18_CR1","DOI":"10.1109\/LICS.2004.1319613"},{"unstructured":"Berardi, S., Coquand, T., Hayashi, S.: Games with 1-backtracking. In: Proceedings of Games for Logic and Programming Languages (2005, also submitted to APAL)","key":"18_CR2"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.apal.2005.04.006","volume":"139","author":"S. Berardi","year":"2006","unstructured":"Berardi, S.: Some intuitionistic equivalents of classical principles for degree 2 formulas. Annals of Pure and Applied Logic\u00a0139, 185\u2013200 (2006)","journal-title":"Annals of Pure and Applied Logic"},{"doi-asserted-by":"crossref","unstructured":"Berardi, S., Yamagata, Y.: A sequent calculus for Limit Computable Mathematics. Annals of Pure and Applied Logic (to appear)","key":"18_CR4","DOI":"10.1016\/j.apal.2008.01.006"},{"doi-asserted-by":"crossref","unstructured":"Berardi, S.: Semantics for Intuitionistic Arithmetic based on Tarski Games with retractable moves. In: Proceedings of TLCA, LNCS, vol. 4583 (2007)","key":"18_CR5","DOI":"10.1007\/978-3-540-73228-0_4"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.2307\/2275524","volume":"60","author":"T. Coquand","year":"1995","unstructured":"Coquand, T.: A Semantics of Evidence for Classical Arithmetic. Journal of Symbolic Logic\u00a060(1), 325\u2013337 (1995)","journal-title":"Journal of Symbolic Logic"},{"doi-asserted-by":"crossref","unstructured":"Griffin, T.G.: A formulae-as-types notion of control. In: Proceedings of Seventeenth Annual ACM Symposium on Principles of Programming languages, pp. 47\u201358 (1990)","key":"18_CR7","DOI":"10.1145\/96709.96714"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45842-5_9","volume-title":"Types for Proofs and Programs","author":"S. Hayashi","year":"2002","unstructured":"Hayashi, S., Nakata, M.: Towards Limit Computable Mathematics. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol.\u00a02277, pp. 125\u2013144. Springer, Heidelberg (2002)"},{"key":"18_CR9","first-page":"1","volume":"77","author":"S. Hayashi","year":"2007","unstructured":"Hayashi, S.: Can Proofs be animated by games? Fundamenta Informaticae\u00a077, 1\u201313 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"18_CR10","first-page":"479","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"W.A. Howard","year":"1980","unstructured":"Howard, W.A.: The Formulae-as-types Notion of Constructions. In: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 479\u2013490. Academic Press, London (1980)"},{"key":"18_CR11","volume-title":"Introduction to Metamathematics","author":"S.C. Kleene","year":"1967","unstructured":"Kleene, S.C.: Introduction to Metamathematics. North-Holland, Amsterdam (1967)"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.2307\/2586648","volume":"63","author":"U. Kohlenbach","year":"1998","unstructured":"Kohlenbach, U.: Relative Constructivity. Journal of Symbolic Logic\u00a063(4), 1218\u20131238 (1998)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76637-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:22Z","timestamp":1619506582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76637-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766360"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76637-7_18","relation":{},"subject":[]}}