The taming of recurrences in computability logic through cirquent calculus. II

DOI10.1007/s00153-012-0314-7zbMath1323.03021arXiv1106.3705OpenAlexW4232764477MaRDI QIDQ1935368

Giorgi Japaridze

Publication date: 15 February 2013

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

game semanticscomputability logicinteractive computationresource semanticscirquent calculus

Mathematics Subject Classification ID

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 ⋮ On the toggling-branching recurrence of computability logic ⋮ Build your own clarithmetic I: Setup and completeness

Cites Work

• Toggling operators in computability logic
• Sequential operators in computability logic
• Introduction to computability logic
• The taming of recurrences in computability logic through cirquent calculus. I
• The intuitionistic fragment of computability logic at the propositional level
• From truth to computability. II.
• From truth to computability. I.
• A logical basis for constructive systems
• The logic of interactive turing reduction

This page was built for publication: The taming of recurrences in computability logic through cirquent calculus. II