Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,182,824 papers from all fields of science
Search
Sign In
Create Free Account
Cirquent calculus
Cirquent calculus is a proof calculus which manipulates graph-style constructs termed cirquents, as opposed to the traditional tree-style objects…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Computability logic
Proof calculus
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Elementary-base cirquent calculus II: Choice quantifiers
G. Japaridze
Logic Journal of the IGPL
2019
Corpus ID: 67750279
Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor…
Expand
2017
2017
Elementary-base cirquent calculus I: Parallel and choice connectives
G. Japaridze
FLAP
2017
Corpus ID: 7492621
Cirquent calculus is a proof system manipulating circuit-style constructs rather than formulas. Using it, this article constructs…
Expand
2014
2014
The Computational Complexity of Propositional Cirquent Calculus
Matthew S. Bauer
Log. Methods Comput. Sci.
2014
Corpus ID: 16719464
Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose…
Expand
2014
2014
A propositional system induced by Japaridze's approach to IF logic
Wenyan Xu
Logic Journal of the IGPL
2014
Corpus ID: 17180821
Cirquent calculus is a new proof-theoretic and semantic approach introduced for the needs of computability logic by G.Japaridze…
Expand
2014
2014
A cirquent calculus system with clustering and ranking
Wenyan Xu
Journal of Applied Logic
2014
Corpus ID: 6228852
2012
2012
Cirquent Calculus System Cl8s versus Calculus of Structures System Sksg for Propositional Logic
Wenyan Xu
,
Sanyang Liu
Quantitative Logic and Soft Computing
2012
Corpus ID: 120308538
Cirquent calculus and calculus of structures are two approaches to proof theory. Both of them apply deep inference which modifies…
Expand
2011
2011
Soundness and completeness of the Cirquent calculus system CL6 for computability logic
Wenyan Xu
,
Sanyang Liu
Logic Journal of the IGPL
2011
Corpus ID: 16271307
Computability logic is a formal theory of computability. The earlier article "Introduction to cirquent calculus and abstract…
Expand
2011
2011
The taming of recurrences in computability logic through cirquent calculus, Part II
G. Japaridze
Archive for Mathematical Logic
2011
Corpus ID: 62774365
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of…
Expand
2011
2011
The Parallel versus Branching Recurrences in Computability Logic
Wenyan Xu
,
Sanyang Liu
Notre Dame J. Formal Log.
2011
Corpus ID: 3086939
This paper shows that the basic logic induced by the parallel recurrence of Computability Logic is a proper superset of the basic…
Expand
2010
2010
Deduction Theorem for Symmetric Cirquent Calculus
Wenyan Xu
,
San-yang Liu
2010
Corpus ID: 14467541
Cirquent calculus is a recent approach to proof theory, whose characteristic feature is being based on circuit-style structures…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE