Introduction to clarithmetic II

Details Introduction to clarithmetic II Introduction to clarithmetic II

2010-04-19

arxiv.org/abs/1004.3236v4

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Introduction to clarithmetic II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Introduction to clarithmetic II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Introduction to clarithmetic II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60156