Cirquent Calculus Deepened

DOI10.1093/LOGCOM/EXN019zbMath1170.03028arXiv0709.1308OpenAlexW1589830330WikidataQ56780729 ScholiaQ56780729MaRDI QIDQ3549318

Giorgi Japaridze

Publication date: 22 December 2008

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

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

zbMATH Keywords

proof theorycomputability logicresource semanticscirquent calculuspigeonhole principledeep inference

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Complexity of proofs (03F20)

Related Items (13)

A cirquent calculus system with clustering and ranking ⋮ 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 ⋮ Towards applied theories based on computability logic ⋮ A new face of the branching recurrence of computability logic ⋮ Extension without cut ⋮ Sequential operators in computability logic ⋮ Many concepts and two logics of algorithmic reduction

This page was built for publication: Cirquent Calculus Deepened