000			02022cam a2200361 4500
001			0000000721
003			RPAM
005			20160624102309.0
006			m 000 0
007			cr/|||||||||||
008			140928s1969 riu o 000 0 eng d
020			_a9781470400385 (online)
040			_cPSt _dWaOLN _dCaOODSS _dRPAM
050	1	4	_aQA3 _b.A57 no. 89
100	1		_aKleene, Stephen Cole, _d1909-1994
245	1	0	_aFormalized recursive functionals and formalized realizability / _h[electronic resource] _cby S.C. Kleene.
260			_aProvidence, R.I. : _bAmerican Mathematical Society, _c1969.
300			_a1 online resource (106 p.)
490	1		_aMemoirs of the American Mathematical Society, _x0065-9266 (print); _x1947-6221 (online); _vv. 89
504			_aIncludes bibliographical references.
505	0	0	_tIntroduction _tPart I. Formalized recursive functionals _t1. Computation tree numbers _t2. $p$-terms and $p$-functors; $r\simeq s$ (definition and basic properties) _t3. Representation of $p$-terms by proper indices _t4. The recursion theorem; the normal form theorem; $\{\tau \}[\alpha ]$ and $\wedge \alpha \, u[\alpha ]$; $!R \,\&\, [A(R)]$ _tPart II. Formalized realizability _t5. Intuitionistically provable formulas are realizable and $\bigcirc \!\!\!\!\!q$\ -realizable
506	1		_aAccess is restricted to licensed institutions
533			_aElectronic reproduction. _bProvidence, Rhode Island : _cAmerican Mathematical Society. _d2012
538			_aMode of access : World Wide Web
588			_aDescription based on print version record.
650		0	_aRecursive functions.
776	0		_iPrint version: _aKleene, Stephen Cole, 1909-1994 _tFormalized recursive functionals and formalized realizability / _x0065-9266 _z9780821812891
786			_dAmerican mathematical Society
830		0	_aMemoirs of the American Mathematical Society ; _vno. 89.
856	4		_3Contents _uhttp://www.ams.org/memo/0089
856	4		_3Contents _uhttp://dx.doi.org/10.1090/memo/0089
942			_2EBK12542 _cEBK
999			_c41836 _d41836