Types for Proofs and Programs

Volume 2277 of the series Lecture Notes in Computer Science pp 125-144


Towards Limit Computable Mathematics

  • Susumu HayashiAffiliated withDepartment of Computer and Systems Engineering, Kobe University
  • , Masahiro NakataAffiliated withGraduate School of Science and Technology, Kobe University

* Final gross prices may vary according to local VAT.

Get Access


The notion of Limit-Computable Mathematics (LCM) will be introduced. LCM is a fragment of classical mathematics in which the law of excluded middle is restricted to Δ 2 0 -formulas. We can give an accountable computational interpretation to the proofs of LCM. The computational content of LCM-proofs is given by Gold’s limiting recursive functions, which is the fundamental notion of learning theory. LCM is expected to be a right means for “Proof Animation”, which was introduced by the first author [10]. LCM is related not only to learning theory and recursion theory, but also to many areas in mathematics and computer science such as computational algebra, computability theories in analysis, reverse mathematics, and many others.