Separating the basic logics of the basic recurrences
arXiv:1007.1324 · doi:10.1016/j.apal.2011.11.009
Abstract
This paper shows that, even at the most basic level, the parallel, countable branching and uncountable branching recurrences of Computability Logic (see http://www.cis.upenn.edu/~giorgi/cl.html) validate different principles.
References in corpus (13)
- Sequential operators in computability logic
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- Propositional computability logic I
- Cirquent calculus deepened
- Computability Logic: a formal theory of interaction
- From truth to computability I
- The intuitionistic fragment of computability logic at the propositional level
- Propositional Computability Logic II
- Many concepts and two logics of algorithmic reduction
- From truth to computability II
- The logic of interactive Turing reduction
- Toggling operators in computability logic
- Towards applied theories based on computability logic
Cited by in corpus (6)
- The taming of recurrences in computability logic through cirquent calculus, Part I
- The parallel versus branching recurrences in computability logic
- On the system CL12 of computability logic
- Elementary-base cirquent calculus I: Parallel and choice connectives
- Build your own clarithmetic I: Setup and completeness
- The countable versus uncountable branching recurrences in computability logic