12 citations · 12 across the 5 of their papers we have counts for
5 papers
A cirquent calculus system with clustering and ranking
Wenyan Xu
Cirquent calculus is a new proof-theoretic and semantic approach introduced by G.Japaridze for the needs of his theory of computability logic. The earlier article "From formulas to…
A propositional system induced by Japaridze's approach to IF logic
Wenyan Xu
Cirquent calculus is a new proof-theoretic and semantic approach introduced for the needs of computability logic by G.Japaridze, who also showed that, through cirquent calculus, on…
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…
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…
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…