Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Adachi, S. Iwata, and T. Kasai, Low level complexity for combinatorial games, Proceedings of 13th SIGACT Symposium, 228–237.
S. A. Cook, The complexity of theorem-proving procedures, Proceedings, Third SIGACT Symposium, 151–178.
A. Chandra, H. R. Lewis, and J. Makowsky, Embedded implicational dependencies and their inference problem, JCSS, to appear.
L. Denenberg, Computational Complexity of Logical Problems: Formulas, Dependencies, and Circuits, PhD thesis, Harvard University, Division of Applied Sciences.
L. Denenberg and H. R. Lewis, The complexity of the satisfiability problem for Krom formulas, Theoretical Computer Science 30, to appear.
C. Dwork, P. Kanellakis, and J. Mitchell, On the sequential nature of unification, Journal of Logic Programming 1,1 (to appear).
M. Furer, Alternation and the Ackermann case of the decision problem, L'Enseignement Mathematique ser. II, XXVII, pp. 137–162.
W. H. Joyner, Jr., Resolution strategies as decision procedures, JACM 23, 398–417.
N. D. Jones and W. T. Laaser, Complete problems for deterministic polynomial time, Theoretical Computer Science 3, 105–117.
N. D. Jones, Y. E. Lien, and W. T. Laaser, New problems complete for nondeterministic log space, Mathematical Systems Theory 10, 1–17.
H. R. Lewis, Complexity results for classes of quantificational formulas, JCSS 21, 317–353.
J. F. Lynch, Complexity classes and theories of finite models, Mathematical Systems Theory, to appear.
H. R. Lewis and L. Denenberg, A hard problem for NTIME(nd), Proceedings, 19th Allerton Conference on Control, Communication, and Computing.
H. R. Lewis and C. H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall Publishing Company.
S. Ju. Maslov, An inverse method of establishing deducibilities in the classical predicate calculus, Soviet Mathematics Doklady 5, 1420–1424.
D. A. Plaisted, Complete problems in the first-order predicate calculus, manuscript.
W. J. Savitch, Relations between deterministic and nondeterministic tape complexities, JCSS 7, pp. 177–192..
E. Y. Shapiro, Alternation and the computational complexity of logic programs, Proceedings of First International Logic Programming Conference, 154–163.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Denenberg, L., Lewis, H.R. (1984). Logical syntax and computational complexity. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099481
Download citation
DOI: https://doi.org/10.1007/BFb0099481
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13901-0
Online ISBN: 978-3-540-39119-7
eBook Packages: Springer Book Archive