This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chandra/Harel, Structure and Complexity of Relational Queries, JCSS 25,p. 99–128
Chandra/Harel, Horn Clauses and the Fixpoint Hierarchy, Proceedings of the ACM-Symposium on Principles of Data Base Systems 82, p. 158–163
Dahlhaus, Reductions to NP-Complete Problems by Interpretations, in Logic and Machines: Decision Problems and Complexity, Börger/Rödding/Hasenjaeger ed., LNCS 171, p. 357–356
Generalized First Order Spectra and Polynomial Time Recognizable Sets, SIAM-AMS-Proceedings 7, p. 43–73
Gurevich/Shelah, Fixed Point Extensions of First-Order-Logic, 26-th IEEE-FOCS
Immerman, Relational Queries Computable in Polynomial Time, 14-th ACM-STOC, p. 147–152
Immerman, Relational Queries Computable in Polynomial Time, Information & Control 68, p. 86–104
Jones/Laaser, Complete Problems for Deterministic Polynomial, Theoretical Computer Science 3, p. 105–117
Moschovakis, Elementary Induction on Abstract Structures, North Holland, Amsterdam
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dahlhaus, E. (1987). Skolem normal forms concerning the least fixpoint. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_158
Download citation
DOI: https://doi.org/10.1007/3-540-18170-9_158
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18170-5
Online ISBN: 978-3-540-47795-2
eBook Packages: Springer Book Archive