On the toggling-branching recurrence of Computability Logic
classification
💻 cs.LO
keywords
computabilitylogicproverecurrencetoggling-branchingversionargumentscanonical
read the original abstract
We introduce a new, substantially simplified version of the toggling-branching recurrence operation of Computability Logic, prove its equivalence to Japaridze's old, "canonical" version, and also prove that both versions preserve the static property of their arguments.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.