From formulas to cirquents in computability logic

DOI10.2168/LMCS-7(2:1)2011zbMath1218.03026arXiv0906.2154MaRDI QIDQ3003318

Giorgi Japaridze

Publication date: 26 May 2011

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

independence-friendly logicgame semanticscomputability logicinteractive computationabstract resource semantics

Mathematics Subject Classification ID

Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Other nonclassical logic (03B60) Logic in computer science (03B70) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (6)

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 ⋮ The countable versus uncountable branching recurrences in computability logic ⋮ Build your own clarithmetic I: Setup and completeness

This page was built for publication: From formulas to cirquents in computability logic