Introduction to Cirquent Calculus and Abstract Resource Semantics

DOI10.1093/logcom/exl005zbMath1113.03023arXivmath/0506553OpenAlexW1968811614WikidataQ56780723 ScholiaQ56780723MaRDI QIDQ3412001

Giorgi Japaridze

Publication date: 4 December 2006

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

sequent calculuslinear logicproof theorysubstructural logicscomputability logicresource semanticscirquent calculusaffine logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Structure of proofs (03F07) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

The intuitionistic fragment of computability logic at the propositional level ⋮ From truth to computability. II. ⋮ A cirquent calculus system with clustering and ranking ⋮ Cirquent Calculus in a Nutshell ⋮ The parallel versus branching recurrences in computability logic ⋮ The taming of recurrences in computability logic through cirquent calculus. I ⋮ Separating the basic logics of the basic recurrences ⋮ Toggling operators in computability logic ⋮ The countable versus uncountable branching recurrences in computability logic ⋮ Build your own clarithmetic I: Setup and completeness ⋮ Introduction to clarithmetic. I ⋮ A PSPACE-complete first-order fragment of computability logic ⋮ Towards applied theories based on computability logic ⋮ On abstract resource semantics and computability logic ⋮ A new face of the branching recurrence of computability logic ⋮ Sequential operators in computability logic ⋮ Many concepts and two logics of algorithmic reduction

This page was built for publication: Introduction to Cirquent Calculus and Abstract Resource Semantics