A propositional cirquent calculus for computability logic
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913574882902016 |
|---|---|
| author | Japaridze, Giorgi |
| author_facet | Japaridze, Giorgi |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_05879 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A propositional cirquent calculus for computability logic Japaridze, Giorgi Logic in Computer Science Logic 03B47, 03B70, 03F03, 03F20, 68T15 F.1.1; F.1.2; F.1.3 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. |
| title | A propositional cirquent calculus for computability logic |
| topic | Logic in Computer Science Logic 03B47, 03B70, 03F03, 03F20, 68T15 F.1.1; F.1.2; F.1.3 |
| url | https://arxiv.org/abs/2406.05879 |