2021/08/28 by Giorgi Japaridze, Japaridze, Giorgi, Bikal Lamichhane +1
Computer Science · #03B47 #03B70 #03F03 #F.1.2 #F.1.3 #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Formal Methods in Verification #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.2108.12552
openalex publication_date 2021/08/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper is a brief and informal presentation of cirquent calculus, a novel proof system for resource-conscious logics. As such, it is a refinement of sequent calculus with mechanisms that allow to explicitly account for the possibility of sharing of subexpressions/subresources between different expressions/resources. This is achieved by dealing with circuit-style constructs, termed cirquents, instead of formulas, sequents or other tree-like structures. The approach exhibits greater expressiveness, flexibility and efficiency compared to the more traditional proof-theoretic approaches.