Abstract
A classical question having its origin in the decision problem for first-order logic, asks for specific classes Φ of sentences whether they have the finite model property, i.e. whether every satisfiable sentence of Φ has a finite model. We are going to consider two examples where we can demonstrate the methodological usefulness of techniques and results we have developed so far.
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). Satisfiability in the Finite. In: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03182-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-03182-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03184-1
Online ISBN: 978-3-662-03182-7
eBook Packages: Springer Book Archive