Abstract
An important part of the classical model theory studies properties of abstract mathematical structures (finite or not) expressible in first-order logic [257]. In the setting of finite model theory, which developed more recently, one studies first-order logic (and its various extensions) just on finite structures [141, 303]. Both theories share many similarities but also display important and profound differences. This will be illustrated in this chapter by means of several examples. We start with a generalization of the coloring problem.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
If you are not what you should not be, you might well be as you should be.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nešetřil, J., de Mendez, P.O. (2012). First-Order Constraint Satisfaction Problems, Limits and Homomorphism Dualities. In: Sparsity. Algorithms and Combinatorics, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27875-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-27875-4_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27874-7
Online ISBN: 978-3-642-27875-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)