LEADER 00708nam2 22002291i 450 
001 990007813000403321
035   $a000781300
035   $aFED01000781300
035   $a(Aleph)000781300FED01
035   $a000781300
100   $a20030801d--------km-y0itay50------ba
200 1 $a<<Il >>nuovo articolo 38 c.p.c. norma ambiguadi difficile applicazione Tomo II, pp.671-686
463  0$1001000777413
610 0 $a
701  1$aMonteleone,$bGirolamo$f<1943- >$0407116
801  0$aIT$bUNINA$gRICA$2UNIMARC
901   $aBK
912   $a990007813000403321
959   $aDDCP
996   $aNuovo articolo 38 c.p.c. norma ambiguadi difficile applicazione Tomo II, pp.671-686$9663902
997   $aUNINA
DB    $aGEN01

LEADER 01076nam0-2200349li-450 
001 990000175870203316
005 20180312154737.0
010   $a0-262-68052-1
035   $a0017587
035   $aUSA010017587
035   $a(ALEPH)000017587USA01
035   $a0017587
100   $a20001109g19871992km-y0itay0103----ba
101 0 $aeng
102   $aUS
200 1 $aTheory of recursive functions and affective computability$fHartley, Rogers
210   $aCambridge (Mass.)$cMIT Press$dcopyr. 1987 (stampa 1992)
610 1 $afunzioni computabili
610 1 $afunzioni ricorsive
676   $a511.3$9.
700  1$aRogers,$bHartley,$bjr.$051746
801   $aSistema bibliotecario di Ateneo dell' Università di Salerno$gRICA
912   $a990000175870203316
951   $a511.3 ROG$b0002317
959   $aBK
969   $aTEC
979   $c19950731
979   $c20001110$lUSA01$h1713
979   $c20020403$lUSA01$h1625
979   $aPATRY$b90$c20040406$lUSA01$h1613
996   $aTheory of recursive functions and affective computability$91501691
997   $aUNISA