2000 character limit reached
A new face of the branching recurrence of computability logic
Published 5 Feb 2011 in cs.LO and math.LO | (1102.1054v2)
Abstract: This letter introduces a new, substantially simplified version of the branching recurrence operation of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proves its equivalence to the old, "canonical" version.
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.