| Record ID | ia:complexitylogicr0187unse |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/complexitylogicr0187unse/complexitylogicr0187unse_marc.xml |
| Download MARC binary | https://www.archive.org/download/complexitylogicr0187unse/complexitylogicr0187unse_meta.mrc |
LEADER: 00831cam a2200241 a 4500
001 96052019
003 DLC
005 20060728213106.0
008 961211s1997 nyua b 000 0 eng
010 $a 96052019
020 $a0824700260 (alk. paper)
040 $aDLC$cDLC$dDLC
050 00 $aQA267.7$b.C664 1997
082 00 $a511.3$221
245 00 $aComplexity, logic, and recursion theory /$cedited by Andrea Sorbi.
260 $aNew York :$bMarcel Dekker,$cc1997.
300 $aviii, 363 p. :$bill. ;$c26 cm.
440 0 $aLecture notes in pure and applied mathematics ;$vv. 187
504 $aIncludes bibliographical references.
650 0 $aComputational complexity.
650 0 $aRecursion theory.
700 1 $aSorbi, Andrea,$d1956-
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy0647/96052019-d.html