{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:36Z","timestamp":1761611316086},"reference-count":14,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2013,1,1]]},"DOI":"10.1215\/00294527-1731389","type":"journal-article","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T14:15:27Z","timestamp":1355494527000},"source":"Crossref","is-referenced-by-count":4,"title":["The Parallel versus Branching Recurrences in Computability Logic"],"prefix":"10.1215","volume":"54","author":[{"given":"Wenyan","family":"Xu","sequence":"first","affiliation":[]},{"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Japaridze, G., \u201cA new face of the branching recurrence of computability logic,\u201d <i>Applied Mathematics Letters<\/i>, vol. 25 (2012), pp. 1585\u20139. DOI <a href=\"10.1016\/j.aml.2011.11.023\">10.1016\/j.aml.2011.11.023<\/a>","DOI":"10.1016\/j.aml.2011.11.023"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Japaridze, G., \u201cThe taming of recurrences in computability logic through cirquent calculus, Part I,\u201d preprint, <a href=\"arXiv:1105.3853v4\">arXiv:1105.3853v4<\/a> [cs.LO]","DOI":"10.1007\/s00153-012-0313-8"},{"key":"11","unstructured":"[11] Japaridze, G., \u201cThe taming of recurrences in computability logic through cirquent calculus, Part II,\u201d preprint, <a href=\"arXiv:1106.3705v1\">arXiv:1106.3705v1<\/a> [cs.LO]"},{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Japaridze, G., \u201cIntroduction to computability logic,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 123 (2003), pp. 1\u201399.","DOI":"10.1016\/S0168-0072(03)00023-X"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Japaridze, G., \u201cIntroduction to cirquent calculus and abstract resource semantics,\u201d <i>Journal of Logic and Computation<\/i>, vol. 16 (2006), pp. 489\u2013532.","DOI":"10.1093\/logcom\/exl005"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Japaridze, G., \u201cThe logic of interactive Turing reduction,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 72 (2007), pp. 243\u201376.","DOI":"10.2178\/jsl\/1174668394"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Japaridze, G., \u201cCirquent calculus deepened,\u201d <i>Journal of Logic and Computation<\/i>, vol. 18 (2008), pp. 983\u20131028.","DOI":"10.1093\/logcom\/exn019"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Japaridze, G., \u201cIn the beginning was game semantics,\u201d pp. 249\u2013350 in <i>Games: Unifying Logic, Language, and Philosophy<\/i>, edited by O. Majer, A.-V. Pietarinen, and T. Tulenheimo, vol. 15 of <i>Logic, Epistemology, and the Unity of Science<\/i>, Springer, New York, 2009.","DOI":"10.1007\/978-1-4020-9374-6_11"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Japaridze, G., \u201cMany concepts and two logics of algorithmic reduction,\u201d <i>Studia Logica<\/i> 91 (2009), pp. 1\u201324.","DOI":"10.1007\/s11225-009-9164-7"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Japaridze, G., \u201cFrom formulas to cirquents in computability logic,\u201d <i>Logical Methods in Computer Science<\/i>, vol. 7 (2011), paper 2:1.","DOI":"10.2168\/LMCS-7(2:1)2011"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Japaridze, G., \u201cSeparating the basic logics of the basic recurrences,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 163 (2012), pp. 377\u201389.","DOI":"10.1016\/j.apal.2011.11.009"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Mezhirov, I., and N. Vereshchagin, \u201cOn abstract resource semantics and computability logic,\u201d <i>Journal of Computer and System Sciences<\/i>, vol. 76 (2010), pp. 356\u201372.","DOI":"10.1016\/j.jcss.2009.10.008"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Xu, W., and S. Liu, \u201cDeduction theorem for symmetric cirquent calculus,\u201d pp. 121\u201326 in <i>Quantitative Logic and Soft Computing 2010<\/i>, vol. 82 of <i>Advances in Intelligent and Soft Computing<\/i>, Springer, Berlin, 2010.","DOI":"10.1007\/978-3-642-15660-1_9"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Xu, W., and S. Liu, \u201cSoundness and completeness of the cirquent calculus system CL6 for computability logic,\u201d <i>Logic Journal of the IGPL<\/i>, vol. 20 (2012), pp. 317\u201330.","DOI":"10.1093\/jigpal\/jzr043"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-1731389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:58:02Z","timestamp":1706648282000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-54\/issue-1\/The-Parallel-versus-Branching-Recurrences-in-Computability-Logic\/10.1215\/00294527-1731389.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,1]]},"references-count":14,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-1731389","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2013,1,1]]}}}