The Computational Complexity of Logical Theories
Ferrante, Jeanne.
The Computational Complexity of Logical Theories [electronic resource] / by Jeanne Ferrante, Charles W. Rackoff. - XII, 244 p. online resource. - Lecture Notes in Mathematics, 718 0075-8434 ; . - Lecture Notes in Mathematics, 718 .
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.
9783540351979
10.1007/BFb0062837 doi
Mathematics.
Mathematics, general.
QA1-939
510
The Computational Complexity of Logical Theories [electronic resource] / by Jeanne Ferrante, Charles W. Rackoff. - XII, 244 p. online resource. - Lecture Notes in Mathematics, 718 0075-8434 ; . - Lecture Notes in Mathematics, 718 .
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.
9783540351979
10.1007/BFb0062837 doi
Mathematics.
Mathematics, general.
QA1-939
510