Abstract
This chapter begins with a question from predicate logic, namely to determine the set of all (sizes of) finite models of a given formula. It turns out that there is an amazingly close relationship between this question and the world of P and NP.
This is a preview of subscription content, log in via an institution to check access.
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
H. Enderton: A Mathematical Introduction to Logic, Academic Press, 1972.
H.J. Keisler, J. Robbin: Mathematical Logic and Computability, McGraw-Hill, 1996.
C.H. Papadimitriou: Computational Complexity, Addison-Wesley, 1994, page 78.
E. Borger: Decision problems in predicate logic, in G. Lolli, Florence Logic Colloquium 82, North-Holland.
C.A. Christen: Spektralproblem und Komplexitatstheorie, in E. Specker, V. Strassen: Komplexitat von Entscheidungsproblemen, Lecture Notes in Computer Science 43, Springer, 1974, 102-126.
R. Fagin: Generalized first-order spectra and polynomial-time recognizable sets, in R. Karp, ed., Complexity of Computation, SIAM-AMS Proceedings, Volume 7, 1974, 43-73.
R. Fagin: Finite-model theory - a personal perspective, Theoretical Computer Science 116 (1993), 3–31.
E. Gradel: The expressive power of second-order Horn logic, Proceedings of the 8th Symposium on Theoretical Aspects of Computer Science, Lecture Notes of Computer Science 480, Springer, 1991, 466-477.
E. Gradel: Capturing complexity classes by fragments of second order logic, Proceedings of the 6th Structure in Complexity Theory Conference, IEEE, 1991, 341-352.
Y. Gurevich: Toward logic tailored for computational complexity, in M.M. Richter et al, Computation and Proof Theory, Lecture Notes in Mathematics 1104, Springer, 1984, 175-216.
N. Immerman: Expressibility as a complexity measure: results and directions, Proceedings of the 2nd Structure in Complexity Theory Conference, IEEE, 1987, 194-202.
N. Immerman: Descriptive and computational complexity, in J. Hartmanis, ed., Computational Complexity Theory, AMS Applied Mathematics Proceedings, Vol. 38, 1989, 75-91.
N.D. Jones, A.L. Selman: Turing machines and the spectra of first-order formulas, The Journal of Symbolic Logic 39, No. 1 (1974), 139–150.
C.H. Papadimitriou: Computational Complexity, Addison-Wesley, 1994.
L.J. Stockmeyer: The polynomial-time hierarchy, Theoretical Computer-Science 3 (1977), 1–22.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schöning, U., Pruim, R. (1998). Spectral Problems and Descriptive Complexity Theory. In: Gems of Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60322-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-60322-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64352-1
Online ISBN: 978-3-642-60322-8
eBook Packages: Springer Book Archive