A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Reflections on Finite Model Theory
2007
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
Preserved Fulltext
Main Finding: All major computational complexity classes, including P, NP, and PSPACE, can be characterized in terms of definability in various logics on classes of finite structures. Reinforces the unity of computation and logic. Yields machine-independent characterizations of computational complexity classes.
doi:10.1109/lics.2007.39
dblp:conf/lics/Kolaitis07
fatcat:3eulyaqcgbfdzihya6kzjxm2ru