Abstract
1. Background in Logic -- 2. Background in Complexity -- 3. First-Order Reductions -- 4. Inductive Definitions -- 5. Parallelism -- 6. Ehrenfeucht-Fraisse Games -- 7. Second-Order Logic and Fagin's Theorem -- 8. Second-Order Lower Bounds -- 9. Complementation and Transitive Closure -- 10. Polynomial Space -- 11. Uniformity and Precomputation -- 12. The Role of Ordering -- 13. Lower Bounds -- 14. Applications -- 15. Conclusions and Future Directions.
Cite
CITATION STYLE
APA
Ebbinghaus, H.-D., & Flum, J. (1995). Descriptive Complexity Theory (pp. 119–163). https://doi.org/10.1007/978-3-662-03182-7_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free