The countable versus uncountable branching recurrences in computability logic

This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by it is a proper superset of the basic logic induced by the uncountable branching recurrence. A further result of this paper is showing that the countable branching recurrence is strictly weaker than the uncountable branching recurrence in the sense that the latter logically implies the former but not vice versa.

💡 Research Summary

The paper investigates two fundamental recurrence operators in Computability Logic (CoL): the countable branching recurrence (denoted ◦|ℵ₀) and the uncountable branching recurrence (denoted ◦|). While the latter has been extensively studied and axiomatized via the cirquent‑calculus system CL15, the former has remained technically cumbersome because its original definition distinguishes between replicative and non‑replicative moves and restricts replication to the environment (⊥).

The authors first propose a new, simplified definition of ◦|ℵ₀. In the new formulation each thread is identified by an infinite bit‑string, and a move of the form w.α simultaneously updates all threads whose prefixes match the finite string w. This eliminates the need for separate replicative moves and makes the operational description much more uniform. The paper then proves, in Theorem 3, that the new definition is logically equivalent to the original “old” definition. The proof proceeds by showing that for any run of the old game there is a corresponding run of the new game with identical winning conditions, and vice‑versa, using structural induction on the underlying binary‑tree (BT) representation of positions.

Having established the equivalence, the authors turn to the logical strength of the operator. They consider the language L₁ = {¬,∧,∨,◦|ℵ₀,◦|ℵ₀} and the language L₂ = {¬,∧,∨,◦|,◦|}. Using the previously constructed CL15 system for L₂ (which is sound and complete for the fragment with ◦| and ◦|), they show that every formula provable in CL15 remains provable when ◦| and ◦| are replaced by ◦|ℵ₀ and ◦|ℵ₀. Moreover, they exhibit concrete formulas—most notably ◦|ℵ₀ P → ◦| P—that are provable in L₁ but not in L₂. This establishes that the set of uniformly valid principles for L₁ is a proper superset of those for L₂, positively settling Conjecture 6.4 from earlier work.

The final major contribution is a separation result between the two recurrences. The authors prove that the uncountable recurrence logically entails the countable one (◦| F ⊨ ◦|ℵ₀ F) because any winning strategy for the former automatically wins in all essentially finite threads required by the latter. Conversely, they construct a counter‑example showing that ◦|ℵ₀ F does not imply ◦| F. The intuition is that ◦| requires a strategy to succeed on all infinite bit‑strings, an uncountable set, whereas ◦|ℵ₀ only demands success on essentially finite strings (those containing finitely many 1’s). The paper formalizes this intuition by presenting a specific game where the player can win all essentially finite threads but fails on some essentially infinite thread, thereby demonstrating the strict weakness of ◦|ℵ₀ relative to ◦|.

In summary, the paper (1) introduces a cleaner, more implementable definition of the countable branching recurrence and proves its equivalence to the traditional definition; (2) shows that the logic induced by {¬,∧,∨,◦|ℵ₀,◦|ℵ₀} strictly extends the logic induced by {¬,∧,∨,◦|,◦|}, confirming a conjecture about the incompleteness of CL15 when ◦|ℵ₀ replaces ◦|; and (3) establishes a strict hierarchy between the two recurrences, with the uncountable version strictly stronger. These results deepen our understanding of the meta‑theory of CoL, clarify the relationships among its core operators, and lay groundwork for future axiomatizations that may incorporate the countable recurrence in a more natural way.