Introduction to clarithmetic. III

DOI10.1016/j.apal.2013.07.012zbMath1303.03089arXiv1008.0770OpenAlexW2041255875MaRDI QIDQ392285

Giorgi Japaridze

Publication date: 13 January 2014

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

Peano arithmeticgame semanticscomputability logicconstructive theoriesinteractive computation

Mathematics Subject Classification ID

Logic in computer science (03B70) First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50) Abstract and axiomatic computability and recursion theory (03D75)

Related Items

The taming of recurrences in computability logic through cirquent calculus. I ⋮ Build your own clarithmetic I: Setup and completeness ⋮ Introduction to clarithmetic. I ⋮ A PSPACE-complete first-order fragment of computability logic

Cites Work

• Introduction to clarithmetic. II
• Introduction to clarithmetic. I
• A logical basis for constructive systems

This page was built for publication: Introduction to clarithmetic. III