Abstract
We will begin to answer the question: What languages can be defined with first-order sentences? The answer, of course, depends on what numerical predicates we are allowed to use. Throughout this section we will assume that we are working with first-order formulas with some fixed finite set of numerical predicates and a fixed interpretation I. In the subsequent sections of this chapter we will make specific choices for these numerical predicates and prove some limitations on the power of first-order sentences. For example, we will show that the numerical predicate x < y cannot be defined by a first-order formula in which the only numerical predicates are of the form x = y and y = x + 1, and that there are regular languages that cannot be defined by first-order sentences in which x < y is the only numerical predicate allowed.
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.
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
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Straubing, H. (1994). Model-Theoretic Games. In: Finite Automata, Formal Logic, and Circuit Complexity. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0289-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0289-9_4
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6695-2
Online ISBN: 978-1-4612-0289-9
eBook Packages: Springer Book Archive