Soundness and completeness of the cirquent calculus system CL6 for computability logic

DOI10.1093/JIGPAL/JZR043zbMATH Open1258.03033arXiv1106.2272OpenAlexW2071793875MaRDI QIDQ2903763FDOQ2903763

Authors: Wenyan Xu, Sanyang Liu 

Publication date: 1 August 2012

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Abstract: Computability logic is a formal theory of computability. The earlier article "Introduction to cirquent calculus and abstract resource semantics" by Japaridze proved soundness and completeness for the basic fragment CL5 of computability logic. The present article extends that result to the more expressive cirquent calculus system CL6, which is a conservative extension of both CL5 and classical propositional logic.

Full work available at URL: https://arxiv.org/abs/1106.2272

Recommendations

• Propositional computability logic I
• Propositional computability logic II
• The taming of recurrences in computability logic through cirquent calculus. II
• The taming of recurrences in computability logic through cirquent calculus. I
• From truth to computability. II.

zbMATH Keywords

computability logiccirquent calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Structure of proofs (03F07)

Cited In (13)

• A PSPACE-complete first-order fragment of computability logic
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Introduction to clarithmetic. II
• Circularity in soundness and completeness
• A cirquent calculus system with clustering and ranking
• On the system CL12 of computability logic
• Build your own clarithmetic. I: Setup and completeness
• Cirquent Calculus in a Nutshell
• The parallel versus branching recurrences in computability logic
• The taming of recurrences in computability logic through cirquent calculus. II
• The taming of recurrences in computability logic through cirquent calculus. I
• The countable versus uncountable branching recurrences in computability logic
• A propositional cirquent calculus for computability logic.

This page was built for publication: Soundness and completeness of the cirquent calculus system CL6 for computability logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903763)