We use cookies to improve your experience with our site.
Mei-Xia Qu, Jun-Feng Luan, Da-Ming Zhu, Meng Du. On the Toggling-Branching Recurrence of Computability Logic[J]. Journal of Computer Science and Technology, 2013, 28(2): 278-284. DOI: 10.1007/s11390-013-1329-1
Citation:
Mei-Xia Qu, Jun-Feng Luan, Da-Ming Zhu, Meng Du. On the Toggling-Branching Recurrence of Computability Logic[J]. Journal of Computer Science and Technology, 2013, 28(2): 278-284. DOI: 10.1007/s11390-013-1329-1
Mei-Xia Qu, Jun-Feng Luan, Da-Ming Zhu, Meng Du. On the Toggling-Branching Recurrence of Computability Logic[J]. Journal of Computer Science and Technology, 2013, 28(2): 278-284. DOI: 10.1007/s11390-013-1329-1
Citation:
Mei-Xia Qu, Jun-Feng Luan, Da-Ming Zhu, Meng Du. On the Toggling-Branching Recurrence of Computability Logic[J]. Journal of Computer Science and Technology, 2013, 28(2): 278-284. DOI: 10.1007/s11390-013-1329-1
On the Toggling-Branching Recurrence of Computability Logic
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.
DownLoad: