The Computational Complexity of Logical Theories / by Jeanne Ferrante, Charles W. Rackoff
(Lecture Notes in Mathematics ; 718)
| データ種別 | 電子ブック |
|---|---|
| 出版情報 | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer , 1979 |
| 本文言語 | 英語 |
| 大きさ | XII, 244 p : online 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 |
|---|---|
| 著者標目 | *Ferrante, Jeanne author Rackoff, Charles W. author SpringerLink (Online service) |
| 件 名 | LCSH:Mathematics FREE:Mathematics FREE:Mathematics, general |
| 分 類 | DC23:510 |
| 巻冊次 | ISBN:9783540351979 
|
| ISBN | 9783540351979 |
| URL | http://dx.doi.org/10.1007/BFb0062837 |
目次／あらすじ