Introduction to clarithmetic. II

DOI10.1016/j.ic.2016.02.002zbMath1343.03045arXiv1004.3236OpenAlexW1879353470MaRDI QIDQ259084

Giorgi Japaridze

Publication date: 10 March 2016

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

Peano arithmeticbounded arithmeticgame semanticscomputability logicconstructive theoriesimplicit computational complexityinteractive computation

Mathematics Subject Classification ID

Logic in computer science (03B70) First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50)

Related Items (4)

Introduction to clarithmetic. III ⋮ Build your own clarithmetic I: Setup and completeness ⋮ Introduction to clarithmetic. I ⋮ A PSPACE-complete first-order fragment of computability logic

Cites Work

• Unnamed Item
• Introduction to clarithmetic. I
• Bounded arithmetic for NC, ALogTIME, L and NL
• Introduction to computability logic
• The intuitionistic fragment of computability logic at the propositional level
• A logical basis for constructive systems
• The logic of interactive turing reduction
• Towards applied theories based on computability logic
• In the beginning was game semantics
• Intuitionistic computability logic

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