Abstract
We now introduce the basic notions of model and truth for first-order languages. Then we prove the completeness theorem, which shows the equivalence between the proof-theoretic notion ├ and the corresponding semantic notion. Following this we give a series of simple but basic results concerning first-order logic. Namely, we will discuss compactness, the elimination of operation symbols, extensions by definitions, Skolem functions, Herbrand’s theorem, and interpretations from one language to another. These results will be useful in discussing decidable and undecidable theories as well as in the model-theoretic portion of the book.
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.
Bibliography
Chang, C. C., Keisler, H. J. Model Theory. Amsterdam: North-Holland Publ. Co. (1974).
Shoenfield, J. Mathematical Logic. Reading: Addison-Wesley (1967).
Tarski, A., Mostowski, A., Robinson, R. M. Undecidable Theories. Amsterdam: North-Holland Publ. Co. (1953).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Inc.
About this chapter
Cite this chapter
Monk, J.D. (1976). Some Basic Results of First-order Logic. In: Mathematical Logic. Graduate Texts in Mathematics, vol 37. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9452-5_12
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9452-5_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9454-9
Online ISBN: 978-1-4684-9452-5
eBook Packages: Springer Book Archive