The countable versus uncountable branching recurrences in computability logic
arXiv:1107.3706
Abstract
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.
arXiv comment20 pages
References in corpus (6)
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- Cirquent calculus deepened
- Many concepts and two logics of algorithmic reduction
- From formulas to cirquents in computability logic
- A new face of the branching recurrence of computability logic
- Separating the basic logics of the basic recurrences