Formalized recursive functionals and formalized realizability / [electronic resource] by S.C. Kleene.
Material type:
TextSeries: Memoirs of the American Mathematical Society ; no. 89.Publication details: Providence, R.I. : American Mathematical Society, 1969Description: 1 online resource (106 p.)ISBN: 9781470400385 (online)Subject(s): Recursive functionsAdditional physical formats: Formalized recursive functionals and formalized realizability /LOC classification: QA3 | .A57 no. 89Online resources: Contents | Contents 
E-BOOKS
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | Link to resource | Available | EBK12542 |
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; $\{\tau \}[\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
Description based on print version record.
There are no comments on this title.