The computational complexity of logical theories / Jeanne Ferrante, Charles W. Rackoff
Type de document : MonographieCollection : Lecture notes in mathematics, 718Langue : anglais.Pays: Allemagne.Éditeur : Berlin : Springer, 1979Description : 1 vol. (X-243 p.) ; 24 cmISBN: 9783540095019.ISSN: 0075-8434.Bibliographie : Bibliogr. p. [234]-238. Index.Sujet MSC : 03D15, Computability and recursion theory, Complexity of computation (including implicit computational complexity)03B25, General logic, Decidability of theories and sets of sentences
03D10, Computability and recursion theory, Turing machines and related notionsEn-ligne : sur Springerlink
Item type | Current library | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
Monographie | CMI Salle 1 | 03 FER (Browse shelf(Opens below)) | Available | 07120-01 |
Bibliogr. p. [234]-238. Index
There are no comments on this title.