{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:41:54Z","timestamp":1725727314845},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389450"},{"type":"electronic","value":"9783642389467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38946-7_7","type":"book-chapter","created":{"date-parts":[[2013,5,27]],"date-time":"2013-05-27T01:30:38Z","timestamp":1369618238000},"page":"61-76","source":"Crossref","is-referenced-by-count":0,"title":["Games with Sequential Backtracking and Complete Game Semantics for Subclassical Logics"],"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: LICS 2004, pp. 192\u2013201 (2004)","key":"7_CR1","DOI":"10.1109\/LICS.2004.1319613"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-02273-9_4","volume-title":"Typed Lambda Calculi and Applications","author":"F. Aschieri","year":"2009","unstructured":"Aschieri, F., Berardi, S.: A Realization Semantics for EM1-Arithmetic. In: Curien, P.-L. (ed.) TLCA 2009. LNCS, vol.\u00a05608, pp. 20\u201334. Springer, Heidelberg (2009)"},{"unstructured":"Aschieri, F.: Learning, Realizability and Games in Classical Arithmetic. Ph. D. thesis, Torino (2011)","key":"7_CR3"},{"unstructured":"Aschieri, F.: Learning Based Realizability for HA + EM1 and 1-Backtracking Games: Soundness and Completeness. APAL Special Issue for CL&C 2010 (2010)","key":"7_CR4"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2159531.2159533","volume":"13","author":"S. Berardi","year":"2012","unstructured":"Berardi, S., De\u2019Liguoro, U.: Interactive Realizers: A New Approach to Program Extraction. ACM Trans. Comput. Log.\u00a013(2), 11 (2012)","journal-title":"ACM Trans. Comput. Log."},{"issue":"10","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.apal.2010.03.002","volume":"161","author":"S. Berardi","year":"2010","unstructured":"Berardi, S., Coquand, T., Hayashi, S.: Games with 1-backtracking. Ann. Pure Appl. Logic\u00a0161(10), 1254\u20131269 (2010)","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-76637-7_18","volume-title":"Programming Languages and Systems","author":"S. Berardi","year":"2007","unstructured":"Berardi, S., Tatsuta, M.: Positive Arithmetic Without Exchange Is a Subclassical Logic. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol.\u00a04807, pp. 271\u2013285. Springer, Heidelberg (2007)"},{"issue":"1","key":"7_CR8","first-page":"63","volume":"207","author":"S. Berardi","year":"2009","unstructured":"Berardi, S., De\u2019Liguoro, U.: Toward the interpretation of non-constructive reasoning as non-monotonic learning. IC\u00a0207(1), 63\u201381 (2009)","journal-title":"IC"},{"issue":"1-3","key":"7_CR9","first-page":"111","volume":"153","author":"S. Berardi","year":"2008","unstructured":"Berardi, S., Yamagata, Y.: A Sequent Calculus for Limit ComputableMathematics. APAL\u00a0153(1-3), 111\u2013126 (2008)","journal-title":"APAL"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-73228-0_4","volume-title":"Typed Lambda Calculi and Applications","author":"S. Berardi","year":"2007","unstructured":"Berardi, S.: Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol.\u00a04583, pp. 23\u201338. Springer, Heidelberg (2007)"},{"unstructured":"Berardi, S.: Interactive Realizability. Summer School Chamb\u00e9ry, June 14-17 (2011), \n                    \n                      http:\/\/www.di.unito.it\/~stefano\/Berardi-RealizationChambery-13Giugno2011.ppt","key":"7_CR11"},{"unstructured":"Curien, P.-L., Herbelin, H.: Abstract machines for dialogue games. CoRR abs\/0706.2544 (2007)","key":"7_CR12"},{"unstructured":"Coquand, T.: A semantics of evidence for classical arithmetic (preliminary version). In: 2nd Workshop on Logical Frameworks, Edinburgh (1991)","key":"7_CR13"},{"key":"7_CR14","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, 325\u2013337 (1995)","journal-title":"Journal of Symbolic Logic"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.2307\/2270580","volume":"30","author":"E.M. Gold","year":"1965","unstructured":"Gold, E.M.: Limiting Recursion. Journal of Symbolic Logic\u00a030, 28\u201348 (1965)","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"M. Hyland","year":"2000","unstructured":"Hyland, M., Ong, L.: On full abstraction for PCF. Information and Computation\u00a0163(2), 285\u2013408 (2000)","journal-title":"Information and Computation"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.tcs.2005.10.019","volume":"350","author":"S. Hayashi","year":"2006","unstructured":"Hayashi, S.: Mathematics based on incremental learning, excluded middle and inductive inference. Theoretical Computer Science\u00a0350(1), 125\u2013139 (2006)","journal-title":"Theoretical Computer Science"},{"key":"7_CR18","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)"},{"issue":"4","key":"7_CR19","first-page":"331","volume":"77","author":"S. Hayashi","year":"2007","unstructured":"Hayashi, S.: Can Proofs be animated by games? Fundamenta Informaticae\u00a077(4), 331\u2013343 (2007)","journal-title":"Fundamenta Informaticae"},{"unstructured":"Herbelin, H.: Sequents qu\u2019on calcule: de l\u2019interpretation du calcul des sequents. Ph. D. thesis, University of Paris VII (1995)","key":"7_CR20"},{"unstructured":"Hodges, W.: Logic and games. In: The Stanford Encyclopedia of Philosophy, Winter (2004), \n                    \n                      http:\/\/plato.stanford.edu\/archives\/win2004\/entries\/logic-games\/","key":"7_CR21"},{"doi-asserted-by":"crossref","unstructured":"Felscher, W.: Lorenzen\u2019s game semantics. In: Handbook of Philosophical Logic, vol. 5, 2nd edn., pp. 115\u2013145. Kluwer Academic Publishers (2002)","key":"7_CR22","DOI":"10.1007\/978-94-017-0458-8_2"},{"unstructured":"Tatsuta, M., Berardi, S.: Non-Commutative Infinitary Peano Arithmetic. In: Proceedings of CSL 2011, pp. 538\u2013552 (2011), Preliminary version: \n                    \n                      http:\/\/www.di.unito.it\/~stefano\/CSL2011-NonCommutativePeanoArithmetic.pdf","key":"7_CR23"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38946-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T07:20:42Z","timestamp":1557732042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38946-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389450","9783642389467"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38946-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}