Image from Amazon.com
Image from Google Jackets
The Computational Complexity of Logical Theories [electronic resource] / by Jeanne Ferrante, Charles W. Rackoff.
Material type:
TextSeries: Lecture Notes in Mathematics ; 718Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1979Description: XII, 244 p. online resourceContent type: - text
- computer
- online resource
- 9783540351979
- 510 23
- QA1-939
Contents:
In:
Springer eBooks
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.
No physical items for this record
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.
There are no comments on this title.