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.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Qu, Meixia, Luan, Junfeng, Zhu, Daming
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Logic in Computer Science
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
DOI:	10.48550/arxiv.1207.1188