Skip to main content
Book Chapter

Finite Model Theory and Descriptive Complexity

  • Grädel E
Springer Berlin Heidelberg, (2007), 125-230
DOI: 10.1007/3-540-68804-8_3
N/ACitations
Citations of this article
31Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This is a survey on the relationship between logical definability and computational complexity on finite structures. Particular emphasis is given to game-based evaluation algorithms for various logical formalisms and to logics capturing complexity classes.

Cite

CITATION STYLE

APA

Grädel, E. (2007). Finite Model Theory and Descriptive Complexity. In Finite Model Theory and Its Applications (pp. 125–230). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-68804-8_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free