{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T19:00:36Z","timestamp":1751569236432},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s11390-013-1329-1","type":"journal-article","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T17:18:41Z","timestamp":1363022321000},"page":"278-284","source":"Crossref","is-referenced-by-count":2,"title":["On the Toggling-Branching Recurrence of Computability Logic"],"prefix":"10.1007","volume":"28","author":[{"given":"Mei-Xia","family":"Qu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-Feng","family":"Luan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Da-Ming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,3,12]]},"reference":[{"issue":"1\/3","key":"1329_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0168-0072(03)00023-X","volume":"123","author":"G Japaridze","year":"2003","unstructured":"Japaridze G (2003) Introduction to computability logic. Annals of Pure and Applied Logic 123(1\/3):1\u201399","journal-title":"Annals of Pure and Applied Logic"},{"key":"1329_CR2","unstructured":"Bauer M\u00a0S. A PSPACE-complete first order fragment of computability logic. http:\/\/arxiv.org\/abs\/1201.4856 , Jan. 2012."},{"key":"1329_CR3","unstructured":"Japaridze G. Computability logic: A formal theory of interaction. In Interactive Computation: The New Paradigm, Goldin D, Smolka S A, Wegner P (eds.), Springer, 2006, pp.183\u2013223."},{"key":"1329_CR4","doi-asserted-by":"crossref","unstructured":"Japaridze G. In the beginning was game semantics. In Games: Unifying Logic, Language, and Philosophy, Majer O, Pietarinen A V, Tulenheimo T (eds.), Springer, 2009, pp.249\u2013350.","DOI":"10.1007\/978-1-4020-9374-6_11"},{"issue":"1","key":"1329_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11225-009-9164-7","volume":"91","author":"G Japaridze","year":"2009","unstructured":"Japaridze G (2009) Many concepts and two logics of algorithmic reduction. Studia Logica 91(1):1\u201324","journal-title":"Studia Logica"},{"issue":"11","key":"1329_CR6","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1016\/j.tcs.2010.11.037","volume":"412","author":"G Japaridze","year":"2011","unstructured":"Japaridze G (2011) Toggling operators in computability logic. Theoretical Computer Science 412(11):971\u20131004","journal-title":"Theoretical Computer Science"},{"issue":"11","key":"1329_CR7","doi-asserted-by":"crossref","first-page":"1585","DOI":"10.1016\/j.aml.2011.11.023","volume":"25","author":"G Japaridze","year":"2012","unstructured":"Japaridze G (2012) A new face of the branching recurrence of computability logic. Applied Mathematics Letters 25(11):1585\u20131589","journal-title":"Applied Mathematics Letters"},{"issue":"1\/2","key":"1329_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s00153-012-0313-8","volume":"52","author":"G Japaridze","year":"2013","unstructured":"Japaridze G (2013) The taming of recurrences in computability logic through cirquent calculus, Part I. Archive for Mathematical Logic 52(1\/2):173\u2013212","journal-title":"Archive for Mathematical Logic"},{"issue":"1\/2","key":"1329_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s00153-012-0314-7","volume":"52","author":"G Japaridze","year":"2013","unstructured":"Japaridze G (2013) The taming of recurrences in computability logic through cirquent calculus, Part II. Archive for Mathematical Logic 52(1\/2):213\u2013259","journal-title":"Archive for Mathematical Logic"},{"issue":"1","key":"1329_CR10","first-page":"1","volume":"1","author":"K Kwon","year":"2010","unstructured":"Kwon K, Hur S (2010) Adding sequential conjunctions to Prolog. J Compu Tech and Applicat 1(1):1\u20133","journal-title":"J. Compu. Tech. and Applicat."},{"issue":"5","key":"1329_CR11","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.jcss.2009.10.008","volume":"76","author":"I Mezhirov","year":"2010","unstructured":"Mezhirov I, Vereshchagin N (2010) On abstract resource semantics and computability logic. Journal of Computer and System Sciences 76(5):356\u2013372","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"1329_CR12","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.jal.2012.05.001","volume":"10","author":"WY Xu","year":"2012","unstructured":"Xu WY, Liu SY (2012) The countable versus uncountable branching recurrences in computability logic. Journal of Applied Logic 10(4):431\u2013446","journal-title":"Journal of Applied Logic"},{"issue":"1","key":"1329_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1215\/00294527-1731389","volume":"54","author":"WY Xu","year":"2013","unstructured":"Xu WY, Liu SY (2013) The parallel versus branching recurrences in computability logic. Notre Dame Journal of Formal Logic 54(1):61\u201378","journal-title":"Notre Dame Journal of Formal Logic"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-013-1329-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-013-1329-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-013-1329-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T17:51:31Z","timestamp":1562781091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-013-1329-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1329"],"URL":"https:\/\/doi.org\/10.1007\/s11390-013-1329-1","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}