A propositional cirquent calculus for computability logic
<|reference_start|>A propositional cirquent calculus for computability logic: Cirquent calculus is a proof system with inherent ability to account for sharing subcomponents in   logical expressions. Within its framework, this article constructs an axiomatization CL18 of the basic   propositional fragment of computability logic the game-semantically conceived logic of computational   resources and tasks. The nonlogical atoms of this fragment represent arbitrary so called static games, and   the connectives of its logical vocabulary are negation and the parallel and choice versions of conjunction   and disjunction. The main technical result of the article is a proof of the soundness and completeness of   CL18 with respect to the semantics of computability logic.<|reference_end|>
@article{japaridze2024a,
    title={A propositional cirquent calculus for computability logic},
    author={Giorgi Japaridze},
    journal={arXiv preprint arXiv:2406.05879},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.05879},
    primaryClass={cs.LO math.LO}
}