Talk:Descriptive complexity theory
Appearance
| Mathematics Mid‑priority | |||||||
| |||||||
| Computer science Low‑importance | ||||||||||||||
| ||||||||||||||
Modal logic
Does anyone know how different modal logics can be used to describe complexity classes? Traversal of Kripke structures etc. I know the complexities of showing satisfiability in different modal logics; how does that relate to classes of languages expressible in those logics? --Spug (talk) 14:05, 8 March 2010 (UTC)