On the toggling-branching recurrence of Computability Logic

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
Veröffentlicht in:arXiv.org 2012-07
Hauptverfasser: Qu, Meixia, Luan, Junfeng, Zhu, Daming
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
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.
ISSN:2331-8422