02133nam 2200589 450 99646662200331620220908105054.03-540-35197-310.1007/BFb0062837(CKB)1000000000438084(SSID)ssj0000322016(PQKBManifestationID)12068598(PQKBTitleCode)TC0000322016(PQKBWorkID)10282128(PQKB)11138121(DE-He213)978-3-540-35197-9(MiAaPQ)EBC5594389(Au-PeEL)EBL5594389(OCoLC)1076238063(MiAaPQ)EBC6842277(Au-PeEL)EBL6842277(PPN)15517861X(EXLCZ)99100000000043808420220908d1979 uy 0engurnn#008mamaatxtccrThe computational complexity of logical theories /J. Ferrante, C. W. Rackoff1st ed. 1979.Berlin, Germany :Springer,[1979]©19791 online resource (XII, 244 p.)Lecture Notes in Mathematics,0075-8434 ;718Bibliographic Level Mode of Issuance: Monograph3-540-09501-2 and 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.Lecture Notes in Mathematics,0075-8434 ;718Predicate calculusPredicate calculus.51003D15mscFerrante Jeanne1949-46752Rackoff Charles W.1948-MiAaPQMiAaPQMiAaPQBOOK996466622003316Computational complexity of logical theories262975UNISA