AuthorFerrante, Jeanne. author
TitleThe Computational Complexity of Logical Theories [electronic resource] / by Jeanne Ferrante, Charles W. Rackoff
ImprintBerlin, Heidelberg : Springer Berlin Heidelberg, 1979
Connect tohttp://dx.doi.org/10.1007/BFb0062837
Descript XII, 244 p. online resource

CONTENT

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


SUBJECT

  1. Mathematics
  2. Mathematics
  3. Mathematics
  4. general