Introduction to clarithmetic. II

DOI10.1016/J.IC.2016.02.002zbMATH Open1343.03045arXiv1004.3236OpenAlexW1879353470MaRDI QIDQ259084FDOQ259084

Giorgi Japaridze

Publication date: 10 March 2016

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

Abstract: The earlier paper "Introduction to clarithmetic I" constructed an axiomatic system of arithmetic based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proved its soundness and extensional completeness with respect to polynomial time computability. The present paper elaborates three additional sound and complete systems in the same style and sense: one for polynomial space computability, one for elementary recursive time (and/or space) computability, and one for primitive recursive time (and/or space) computability.

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

Recommendations

• Introduction to clarithmetic. III
• On a Theory for AC0 and the Strength of the Induction Scheme
• Introduction to clarithmetic. I
• Build your own clarithmetic. II: Soundness
• Build your own clarithmetic. I: Setup and completeness
• scientific article
• Propositional computability logic I
• scientific article; zbMATH DE number 1163982
• Arithmetics base on computability logic
• Soundness and completeness of the cirquent calculus system CL6 for computability logic

zbMATH Keywords

bounded arithmeticcomputability logicconstructive theoriesgame semanticsimplicit computational complexityinteractive computationPeano arithmetic

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)
• Intuitionistic computability logic
• Introduction to clarithmetic. I

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259084)