Results 1 
2 of
2
Constructing Recursion Operators in Intuitionistic Type Theory
 Journal of Symbolic Computation
, 1984
"... MartinLöf's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of wellfounded relations is presented. Using primitive recursion over higher types, induction and recursion are formally ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
MartinLöf's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of wellfounded relations is presented. Using primitive recursion over higher types, induction and recursion are formally derived for a large class of wellfounded relations. Included are < on natural numbers, and relations formed by inverse images, addition, multiplication, and exponentiation of other relations. The constructions are given in full detail to allow their use in theorem provers for Type Theory, such as Nuprl. The theory is compared with work in the field of ordinal recursion over higher types.
Epsilonsubstitution method for the ramified language and # 1 comprehension rule
 Logic and Foundations of Mathematics
, 1999
"... We extend to Ramified Analysis the definition and termination proof of Hilbert’s ɛsubstitution method. This forms a base for future extensions to predicatively reducible subsystems of analysis. First such system treated here is second order arithmetic with ∆1 1comprehension rule. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We extend to Ramified Analysis the definition and termination proof of Hilbert’s ɛsubstitution method. This forms a base for future extensions to predicatively reducible subsystems of analysis. First such system treated here is second order arithmetic with ∆1 1comprehension rule.