LEADER 01580nam0 22003853i 450 
001 AQ10004525
005 20251003044041.0
010   $a0262680521
100   $a20200213d1987    ||||0itac50      ba
101 | $aeng
102   $aus
181  1$6z01$ai $bxxxe  
182  1$6z01$an
183  1$6z01$anc$2RDAcarrier
200 1 $aTheory of recursive functions and effective computability$fHartley Rogers jr
210   $aCambridge, Mass.$aLondon$cThe MIT press$dc1987
215   $aXXI, 482 p.$d23 cm
500 10$aTheory of recursive functions and effective computability$3LO10301963$9AQ1V002413$979555
606   $aFunzioni recorsive$2FIR$3NAPC270619$9I
606   $aFunzioni computabili$2FIR$3CFIC052682$9I
676   $a511.3$9LOGICA MATEMATICA (LOGICA SIMBOLICA)$v14
676   $a511.3$9LOGICA SIMBOLICA (LOGICA MATEMATICA)$v20
676   $a511.3$9LOGICA MATEMATICA (LOGICA SIMBOLICA)$v22
696   $aFunzioni algoritmiche
699   $aFunzioni computabili$yFunzioni algoritmiche
700  1$aRogers$b, Hartley$3AQ1V002413$4070$051746
790  1$aRogers$b, Hartley$c <jr>$3SBNV064748$zRogers, Hartley
801  3$aIT$bIT-000000$c20200213
850   $aIT-BN0095          
901   $bNAP 01$cSALA DING $n$
912   $aAQ10004525
950  0$aBiblioteca Centralizzata di Ateneo$b1 v.$c1 v.$d 01SALA DING 511.3                   ROG.th$e 0102 0000008225  VMA A4                    1 v. (3. rist. 1992)$fY $h19940323$i19940323
977   $a 01
996   $aTheory of recursive functions and effective computability$979555
997   $aUNISANNIO