14 citations · 26 across the 7 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.LO2011
The countable versus uncountable branching recurrences in computability logic
Wenyan Xu, Sanyang Liu
This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic i…
cs.LO2011★ 12 cited
The parallel versus branching recurrences in computability logic
Wenyan Xu, Sanyang Liu
This paper shows that the basic logic induced by the parallel recurrence of Computability Logic is a proper superset of the basic logic induced by the branching recurrence. The lat…
cs.LO2011
Soundness and completeness of the cirquent calculus system CL6 for computability logic
Wenyan Xu, Sanyang Liu
Computability logic is a formal theory of computability. The earlier article "Introduction to cirquent calculus and abstract resource semantics" by Japaridze proved soundness and c…