2017/07/16 by Giorgi Japaridze, Japaridze, Giorgi
Computer Science · #03B47 #03B70 #03F03 #03F20 #68T15 #F.1.1 #F.1.2 #F.1.3 #FOS: Computer and information sciences #FOS: Mathematics #Formal Methods in Verification #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Parallel Computing and Optimization Techniques
paper · pdf · doi:10.48550/arxiv.1707.04823
openalex publication_date 2017/07/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Cirquent calculus is a proof system manipulating circuit-style constructs rather than formulas. Using it, this article constructs a sound and complete axiomatization CL16 of the propositional fragment of computability logic (the game-semantically conceived logic of computational problems - see http://www.csc.villanova.edu/~japaridz/CL/ ) whose logical vocabulary consists of negation and parallel and choice connectives, and whose atoms represent elementary, i.e. moveless, games.