Abstract
One of the major aims of finite model theory consists in characterizing the queries in a given complexity class by means of a logic in which they can be described. In this way one obtains a new measure of complexity: the complexity of formal descriptions. Moreover, the characterizations allow to translate problems on complexity classes into purely modeltheoretic problems, thus opening them to modeltheoretic methods. In general, this relationship between complexity classes and logics turns out to be useful for both, complexity theory and logic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ebbinghaus, HD., Flum, J. (1995). Finite Automata and Logic: A Microcosm of Finite Model Theory. In: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03182-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-03182-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03184-1
Online ISBN: 978-3-662-03182-7
eBook Packages: Springer Book Archive