The computational complexity of logical theories
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in mathematics
718 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • The computational complexity of logical theories, Jeanne Ferrante, Charles W. Rackoff, 1979, Berlin, Springer, 1 vol. (X-243 p.), Lecture notes in mathematics, 0-387-09501-2 • The Computational Complexity of Logical Theories, Texte imprimé, 9783662209806 |
Sommario:
- 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.