![The Computational Complexity of Logical Theories [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
The Computational Complexity of Logical Theories [electronic resource] /
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.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
1979
|
| Subjects: | Mathematics., Mathematics, general., |
| Online Access: | http://dx.doi.org/10.1007/BFb0062837 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|