Results 1 -
2 of
2
Metapredicative And Explicit Mahlo: A Proof-Theoretic Perspective
"... After briefly discussing the concepts of predicativity, metapredicativity and impredicativity, we turn to the notion of Mahloness as it is treated in various contexts. Afterwards the ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
After briefly discussing the concepts of predicativity, metapredicativity and impredicativity, we turn to the notion of Mahloness as it is treated in various contexts. Afterwards the
Formalizing Non-Termination of Recursive Programs
- J. of Logic and Algebraic Programming
, 2001
"... In applicative theories the recursion theorem provides a term rec which solves recursive equations. However, it is not provable that a solution obtained by rec is minimal. In the present paper we introduce an applicative theory in which it is possible to dene a least xed point operator. Still, o ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In applicative theories the recursion theorem provides a term rec which solves recursive equations. However, it is not provable that a solution obtained by rec is minimal. In the present paper we introduce an applicative theory in which it is possible to dene a least xed point operator. Still, our theory has a standard recursion theoretic interpretation. 1
