The countable versus uncountable branching recurrences in computability logic

Japaridze, 2003, Introduction to computability logic, Annals of Pure and Applied Logic, 123, 1, 10.1016/S0168-0072(03)00023-X Japaridze, 2006, Introduction to cirquent calculus and abstract resource semantics, Journal of Logic and Computation, 16, 489, 10.1093/logcom/exl005 Japaridze, 2008, Cirquent calculus deepened, Journal of Logic and Computation, 18, 983, 10.1093/logcom/exn019 Japaridze, 2009, In the beginning was game semantics, 249 Japaridze, 2009, Many concepts and two logics of algorithmic reduction, Studia Logica, 91, 1, 10.1007/s11225-009-9164-7 Japaridze, 2010, Towards applied theories based on computability logic, Journal of Symbolic Logic, 75, 565, 10.2178/jsl/1268917495 Japaridze, 2011, From formulas to cirquents in computability logic, Logical Methods in Computer Science, 7, 1, 10.2168/LMCS-7(2:1)2011 Japaridze, 2012, Separating the basic logics of the basic recurrences, Annals of Pure and Applied Logic, 163, 377, 10.1016/j.apal.2011.11.009 Japaridze, 2012, A new face of the branching recurrence of computability logic, Applied Mathematics Letters, 25, 1585, 10.1016/j.aml.2011.11.023 Japaridze Japaridze Mezhirov, 2010, On abstract resource semantics and computability logic, Journal of Computer and System Sciences, 76, 356, 10.1016/j.jcss.2009.10.008 Xu, 2010, Deduction theorem for symmetric cirquent calculus, Advances in Intelligent and Soft Computing, 82, 121, 10.1007/978-3-642-15660-1_9 Xu, 2012, Soundness and completeness of the cirquent calculus system CL6 for computability logic, Logic Journal of the IGPL, 20, 317, 10.1093/jigpal/jzr043