A propositional cirquent calculus for computability logic.

Logic in computer science (03B70) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof theory in general (including proof-theoretic semantics) (03F03) Complexity of proofs (03F20) Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A cirquent calculus system with clustering and ranking
Separating the basic logics of the basic recurrences
Linear logic
Toggling operators in computability logic
On abstract resource semantics and computability logic
Sequential operators in computability logic
Many concepts and two logics of algorithmic reduction
A game semantics for linear logic
Introduction to computability logic
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
The intuitionistic fragment of computability logic at the propositional level
From truth to computability. II.
On the toggling-branching recurrence of computability logic
From truth to computability. I.
A logical basis for constructive systems
Soundness and completeness of the Cirquent calculus system CL6 for computability logic
On the system CL12 of computability logic
On the proof complexity of deep inference
On linear rewriting systems for Boolean logic and some applications to proof theory
A Local System for Classical Logic
From formulas to cirquents in computability logic
Introduction to Cirquent Calculus and Abstract Resource Semantics
The logic of interactive turing reduction
Cirquent Calculus Deepened
In the beginning was game semantics
A constructive analysis of RM
A propositional system induced by Japaridze's approach to IF logic
Elementary-base cirquent calculus II: Choice quantifiers
The Computational Complexity of Propositional Cirquent Calculus
Propositional computability logic I
Propositional computability logic II
A PSPACE-complete first-order fragment of computability logic
Degrees of indeterminacy of games

This page was built for publication: A propositional cirquent calculus for computability logic.

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