2000 character limit reached
Separating the basic logics of the basic recurrences
Published 8 Jul 2010 in cs.LO and math.LO | (1007.1324v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.