Kleene, Stephen Cole, 1909-1994

Formalized recursive functionals and formalized realizability / [electronic resource] by S.C. Kleene. - Providence, R.I. : American Mathematical Society, 1969. - 1 online resource (106 p.) - Memoirs of the American Mathematical Society, v. 89 0065-9266 (print); 1947-6221 (online); . - Memoirs of the American Mathematical Society ; no. 89. .

Includes bibliographical references.

Introduction Part I. Formalized recursive functionals 1. Computation tree numbers 2. $p$-terms and $p$-functors; $r\simeq s$ (definition and basic properties) 3. Representation of $p$-terms by proper indices 4. The recursion theorem; the normal form theorem; $\[\alpha ]$ and $\wedge \alpha \, u[\alpha ]$; $!R \,\&\, [A(R)]$ Part II. Formalized realizability 5. Intuitionistically provable formulas are realizable and $\bigcirc \!\!\!\!\!q$\ -realizable

Access is restricted to licensed institutions


Electronic reproduction.
Providence, Rhode Island :
American Mathematical Society.
2012


Mode of access : World Wide Web

9781470400385 (online)


Recursive functions.

QA3 / .A57 no. 89
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha