Revision as of 03:17, 11 January 2010 edit RobinK (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,059 edits Rating article for WikiProject Mathematics. Quality: Stub / Priority: Mid / Field: discrete (script assisted). Please report any errors on my talk page. ← Previous edit		Revision as of 14:05, 8 March 2010 edit undo Spug (talk \| contribs) Extended confirmed users 647 edits →Modal logic: new section Next edit →
Line 2: {{WPCS\|importance=low\|class=stub}} == Modal logic == Does anyone know how different [[modal logic]]s 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? --[[User:Spug\|Spug]] ([[User talk:Spug\|talk]]) 14:05, 8 March 2010 (UTC)

Talk:Descriptive complexity theory: Difference between revisions