Abstract
In this chapter we give the basic definitions and results concerning the syntax of first-order languages: terms, formulas, proofs, etc. As we proceed we shall also check the effectiveness of many of the notions, although at a later stage we shall just appeal to the weak Church’s thesis (see the comments preceding 3.3). This long section contains only very elementary facts, which will be used later mainly without citation. The basic definitions of syntactical notions occupy 10.1-10.18. The remainder of the chapter is concerned with elements of proof theory; this plays an important role in our discussion of decidable and undecidable theories in Part III, but will not be used in the discussion of model theory (Part IV).
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
Church, A. Introduction to Mathematical Logic, Vol. I. Princeton: Princeton Univ. Press (1956).
Shoenfield, J. Mathematical Logic. Reading: Addison-Wesley (1967).
Tarski, A. A simplified formalization of predicate logic with identity. Arch. f. Math. Logik u. Grundl., 7 (1965), 61–79.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Inc.
About this chapter
Cite this chapter
Monk, J.D. (1976). Syntactics of First-order Languages. In: Mathematical Logic. Graduate Texts in Mathematics, vol 37. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9452-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9452-5_11
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