2000 character limit reached
Introduction to clarithmetic II (1004.3236v6)
Published 19 Apr 2010 in cs.LO, cs.CC, math.LO, and math.NT
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.