Introduction to clarithmetic. I

DOI10.1016/J.IC.2011.07.002zbMath1243.03075arXiv1003.4719OpenAlexW4206687466MaRDI QIDQ642523

Giorgi Japaridze

Publication date: 27 October 2011

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

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

zbMATH Keywords

Peano arithmeticbounded arithmeticgame semanticscomputability logicimplicit 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 (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to clarithmetic. II
• Introduction to clarithmetic. III
• Toggling operators in computability logic
• On abstract resource semantics and computability logic
• Sequential operators in computability logic
• Many concepts and two logics of algorithmic reduction
• Bounded arithmetic for NC, ALogTIME, L and NL
• A game semantics for linear logic
• Bounded linear logic: A modular approach to polynomial-time computability
• Light linear logic
• Introduction to computability logic
• An arithmetic for non-size-increasing polynomial-time computation
• The intuitionistic fragment of computability logic at the propositional level
• From truth to computability. II.
• From truth to computability. I.
• An arithmetic for polynomial-time computation
• A logical basis for constructive systems
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• The logic of interactive turing reduction
• Cirquent Calculus Deepened
• Towards applied theories based on computability logic
• In the beginning was game semantics
• Games and full completeness for multiplicative linear logic
• A new “feasible” arithmetic
• Computability Logic: A Formal Theory of Interaction
• Propositional computability logic I
• Propositional computability logic II
• Intuitionistic computability logic
• Degrees of indeterminacy of games

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