Abstract
This chapter presents a theorem from 1990 by Bruno Courcelle that furthers relations between logic and complexity classes that were originated by Ron Fagin. Monadic second-order logic and tree decompositions of graphs are at front and center, but lurking behind Big-Oh notations are huge constants that render the associated algorithms “galactic” until further notice.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lipton, R.J., Regan, K.W. (2013). Ron Fagin: Second-Order Logic. In: People, Problems, and Proofs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41422-0_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-41422-0_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41421-3
Online ISBN: 978-3-642-41422-0
eBook Packages: Computer ScienceComputer Science (R0)