LEADER 02133nam  2200589   450 
001 996466622003316
005 20220908105054.0
010   $a3-540-35197-3
024 7 $a10.1007/BFb0062837
035   $a(CKB)1000000000438084
035   $a(SSID)ssj0000322016
035   $a(PQKBManifestationID)12068598
035   $a(PQKBTitleCode)TC0000322016
035   $a(PQKBWorkID)10282128
035   $a(PQKB)11138121
035   $a(DE-He213)978-3-540-35197-9
035   $a(MiAaPQ)EBC5594389
035   $a(Au-PeEL)EBL5594389
035   $a(OCoLC)1076238063
035   $a(MiAaPQ)EBC6842277
035   $a(Au-PeEL)EBL6842277
035   $a(PPN)15517861X
035   $a(EXLCZ)991000000000438084
100   $a20220908d1979      uy             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 14$aThe computational complexity of logical theories /$fJ. Ferrante, C. W. Rackoff
205   $a1st ed. 1979.
210  1$aBerlin, Germany :$cSpringer,$d[1979]
210  4$dİ1979
215   $a1 online resource (XII, 244 p.)
225 1 $aLecture Notes in Mathematics,$x0075-8434 ;$v718
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-09501-2 
327   $aand background -- Ehrenfeucht games and decision procedures -- Integer addition ? An example of an Ehrenfeucht game decision procedure -- Some additional upper bounds -- Direct products of theories -- Lower bound preliminaries -- A technique for writing short formulas defining complicated properties -- A lower bound on the theories of pairing functions -- Some additional lower bounds.
410  0$aLecture Notes in Mathematics,$x0075-8434 ;$v718
606   $aPredicate calculus
615  0$aPredicate calculus.
676   $a510
686 0 $a03D15$2msc
700   $aFerrante$b Jeanne$f1949-$046752
702   $aRackoff$b Charles W.$f1948-
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996466622003316
996   $aComputational complexity of logical theories$9262975
997   $aUNISA