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

&
Logic Journal of the IGPL 20 (1):317-330 (2012)
  Copy   BIBTEX

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

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzr043

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The taming of recurrences in computability logic through cirquent calculus, Part II.Giorgi Japaridze - 2013 - Archive for Mathematical Logic 52 (1-2):213-259.
The taming of recurrences in computability logic through cirquent calculus, Part I.Giorgi Japaridze - 2013 - Archive for Mathematical Logic 52 (1-2):173-212.
The Parallel versus Branching Recurrences in Computability Logic.Wenyan Xu & Sanyang Liu - 2013 - Notre Dame Journal of Formal Logic 54 (1):61-78.
The intuitionistic fragment of computability logic at the propositional level.Giorgi Japaridze - 2007 - Annals of Pure and Applied Logic 147 (3):187-227.
Towards applied theories based on computability logic.Giorgi Japaridze - 2010 - Journal of Symbolic Logic 75 (2):565-601.
The Logic of Interactive Turing Reduction.Giorgi Japaridze - 2007 - Journal of Symbolic Logic 72 (1):243 - 276.
Kripke semantics and proof systems for combining intuitionistic logic and classical logic.Chuck Liang & Dale Miller - 2013 - Annals of Pure and Applied Logic 164 (2):86-111.
Introduction to mathematical logic.Michał Walicki - 2012 - Hackensack, NJ: World Scientific.
Completeness and partial soundness results for intersection and union typing for λ ¯ μ μ ̃.Steffen van Bakel - 2010 - Annals of Pure and Applied Logic 161 (11):1400-1430.
Four-valued Logic.Katalin Bimbó & J. Michael Dunn - 2001 - Notre Dame Journal of Formal Logic 42 (3):171-192.
A cut-free Gentzen formulation of basic propositional calculus.Kentaro Kikuchi & Katsumi Sasaki - 2003 - Journal of Logic, Language and Information 12 (2):213-225.
Completeness: from Gödel to Henkin.Maria Manzano & Enrique Alonso - 2014 - History and Philosophy of Logic 35 (1):1-26.
A note on the completeness of Kozen's axiomatisation of the propositional μ-calculus.Igor Walukiewicz - 1996 - Bulletin of Symbolic Logic 2 (3):349-366.
The quantified argument calculus.Hanoch Ben-Yami - 2014 - Review of Symbolic Logic 7 (1):120-146.
A sound and complete tableau calculus for reasoning about only knowing and knowing at most.Riccardo Rosati - 2001 - Studia Logica 69 (1):171-191.

Analytics

Added to PP
2015-02-04

Downloads
9 (#1,228,347)

6 months
4 (#800,606)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

A propositional system induced by Japaridze's approach to IF logic.W. Xu - 2014 - Logic Journal of the IGPL 22 (6):982-991.
A cirquent calculus system with clustering and ranking.Wenyan Xu - 2016 - Journal of Applied Logic 16:37-49.
The Parallel versus Branching Recurrences in Computability Logic.Wenyan Xu & Sanyang Liu - 2013 - Notre Dame Journal of Formal Logic 54 (1):61-78.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references