Computational complexity theory, edited by Juris Hartmanis, Proceedings of symposia in applied mathematics, vol. 38, American Mathematical Society, Providence1989, ix + 128 pp

Uwe Schöning

doi:10.2307/2274929

Computational complexity theory, edited by Juris Hartmanis, Proceedings of symposia in applied mathematics, vol. 38, American Mathematical Society, Providence1989, ix + 128 pp [Book Review]

Journal of Symbolic Logic 56 (1):335-336 (1991)

Abstract	This article has no associated abstract. (fix it)
Keywords	No keywords specified (fix it)
Categories	Logic and Philosophy of Logic Model Theory in Logic and Philosophy of Logic (categorize this paper)
DOI	10.2307/2274929
Options	Edit this record Mark as duplicate Export citation Find it on Scholar Request removal from index Revision history

Download options

PhilArchive copy

Upload a copy of this paper Check publisher's policy Papers currently archived: 57,077

External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)

Through your library

Sign in / register and customize your OpenURL resolver..
Configure custom resolver

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Hartmanis J.. Context-Free Languages and Turing Machine Computations. Mathematical Aspects of Computer Science, Proceedings of Symposia in Applied Mathematics, Vol. 19, American Mathematical Society, Providence 1967, Pp. 42–51. [REVIEW]S. Ginsburg - 1972 - Journal of Symbolic Logic 37 (4):759-759.

Lamber Joachim. The Mathematics of Sentence Structure. American Mathematical Monthly, Vol. 65 No. 3 , Pp. 154–170.Lambek Joachim. Contributions to a Mathematical Analysis of the English Verb-Phrase. Journal of the Canadian Linguistic Association, Vol. 5 , Pp. 83–89.Lambek Joachim. On the Calculus of Syntactic Types. Structure of Language and its Mathematical Aspects, Proceedings of Symposia in Applied Mathematics, Vol. 12, American Mathematical Society, Providence 1961, Pp. 166–178.Court L. M., Lambek J., Hiż H.. Comments. Structure of Language and its Mathematical Aspects, Proceedings of Symposia in Applied Mathematics, Vol. 12, American Mathematical Society, Providence 1961, Pp. 264–265.Cohen Joel M.. The Equivalence of Two Concepts of Categorial Grammar. Information and Control, Vol. 10 , Pp. 475–484. [REVIEW]Eliahu Shamir - 1968 - Journal of Symbolic Logic 33 (4):627-628.

Review: Juris Hartmanis, Computational Complexity Theory. [REVIEW]Uwe Schoning - 1991 - Journal of Symbolic Logic 56 (1):335-336.

W. V. Quine. Logic as a Source of Syntactical Insights. Structure of Language and its Mathematical Aspects, Proceedings of Symposia in Applied Mathematics, Vol. 12, American Mathematical Society, Providence 1961, Pp. 1–5. - Irina Lynch, W. V. Quine. Comments. Structure of Language and its Mathematical Aspects, Proceedings of Symposia in Applied Mathematics, Vol. 12, American Mathematical Society, Providence 1961, Pp. 254–255. [REVIEW]Ann M. Singleterry - 1966 - Journal of Symbolic Logic 31 (3):496-497.

Wells Rulon. A Measure of Subjective Information. Structure of Language and its Mathematical Aspects, Proceedings of Symposia in Applied Mathematics, Vol. 12, American Mathematical Society, Providence, Rhode Island, 1961, Pp. 237–244.Sable J. D., Wells R.. Comments. Structure of Language and its Mathematical Aspects, Proceedings of Symposia in Applied Mathematics, Vol. 12, American Mathematical Society, Providence, Rhode Island, 1961, Pp. 267–268. [REVIEW]Nuel D. Belnap - 1965 - Journal of Symbolic Logic 30 (2):244-245.

Wang Hao. The Mechanization of Mathematical Arguments. Experimental Arithmetic, High Speed Computing and Mathematics, Proceedings of Symposia in Applied Mathematics, Vol. 15, American Mathematical Society, Providence 1963, Pp. 31–40. [REVIEW]David C. Cooper - 1967 - Journal of Symbolic Logic 32 (1):120-120.

Robinson J. A.. A Review of Automatic Theorem-Proving. Mathematical Aspects of Computer Science, Proceedings of Symposia in Applied Mathematics, Vol. 19, American Mathematical Society, Providence 1967, Pp. 1–18. [REVIEW]L. Wos - 1974 - Journal of Symbolic Logic 39 (1):190-190.

Abernathy Robert. The Problem of Linguistic Equivalence. Structure of Language and its Mathematical Aspects, Proceedings of Symposia in Applied Mathematics, Vol. 12, American Mathematical Society, Providence 1961, Pp. 95–98. [REVIEW]L. Jonathan Cohen - 1966 - Journal of Symbolic Logic 31 (4):668-668.

Davis Martin. Eliminating the Irrelevant From Mechanical Proofs. Experimental Arithmetic, High Speed Computing and Mathematics, Proceedings of Symposia in Applied Mathematics, Vol. 15, American Mathematical Society, Providence 1963, Pp. 15–30. [REVIEW]J. A. Robinson - 1967 - Journal of Symbolic Logic 32 (1):118-119.

McCarthy John. Computer Programs for Checking Mathematical Proofs. Recursive Function Theory, Proceedings of Symposia in Pure Mathematics, Vol. 5, American Mathematical Society, Providence 1962, Pp. 219–227. [REVIEW]J. A. Robinson - 1968 - Journal of Symbolic Logic 32 (4):523-523.

Henry Hiż. Congrammaticality, Batteries of Transformations and Grammatical Categories. Structure of Language and its Mathematical Aspects, Proceedings of Symposia in Applied Mathematics, Vol. 12, American Mathematical Society, Providence 1961, Pp. 43–50. - H. Hiż. The Intuitions of Grammatical Categories. Methodos, Vol. 12 , Pp. 311–319. [REVIEW]G. H. Matthews - 1967 - Journal of Symbolic Logic 32 (1):115-116.

Halpern J. D. And Läuchli H.. A Partition Theorem. Transactions of the American Mathematical Society, Vol. 124 , Pp. 360–367.Halpern J. D. And Lévy A.. The Boolean Prime Ideal Theorem Does Not Imply the Axiom of Choice. Axiomatic Set Theory, Proceedings of Symposia in Pure Mathematics, Vol. 13 Part 1, American Mathematical Society, Providence, Rhode Island, 1971, Pp. 83–134. [REVIEW]David Pincus - 1974 - Journal of Symbolic Logic 39 (1):181-182.

Myhill John. Ω — Λ. Recursive Function Theory, Proceedings of Symposia in Pure Mathematics, Vol. 5, American Mathematical Society, Providence 1962, Pp. 97–104. [REVIEW]Erik Ellentuck - 1969 - Journal of Symbolic Logic 33 (4):619-620.

Shoenfield J. R.. The Form of the Negation of a Predicate. Recursive Function Theory, Proceedings of Symposia in Pure Mathematics, Vol. 5, American Mathematical Society, Providence 1962, Pp. 131–134. [REVIEW]Ann M. Singleterry - 1968 - Journal of Symbolic Logic 33 (1):116-116.

Shelah Saharon. Categoricity of Uncountable Theories. Proceedings of the Tarski Symposium, An International Symposium Held to Honor Alfred Tarski on the Occasion of His Seventieth Birthday, Edited by Henkin Leon Et Al., Proceedings of Symposia in Pure Mathematics, Vol. 25, American Mathematical Society, Providence, R.I., 1974, Pp. 187–203. [REVIEW]Daniel Lascar - 1981 - Journal of Symbolic Logic 46 (4):866-867.

Analytics

Added to PP index
2014-04-06

Total views
8 ( #946,592 of 2,411,342 )

Recent downloads (6 months)
1 ( #538,938 of 2,411,342 )

How can I increase my downloads?

Downloads