Some Basic Results of First-order Logic

  • J. Donald Monk
Part of the Graduate Texts in Mathematics book series (GTM, volume 37)


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.


Completeness Theorem Relation Symbol Operation Symbol Individual Constant Translation Condition 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chang, C. C., Keisler, H. J. Model Theory. Amsterdam: North-Holland Publ. Co. (1974).Google Scholar
  2. 2.
    Shoenfield, J. Mathematical Logic. Reading: Addison-Wesley (1967).MATHGoogle Scholar
  3. 3.
    Tarski, A., Mostowski, A., Robinson, R. M. Undecidable Theories. Amsterdam: North-Holland Publ. Co. (1953).MATHGoogle Scholar

Copyright information

© Springer-Verlag Inc. 1976

Authors and Affiliations

  • J. Donald Monk
    • 1
  1. 1.Department of MathematicsUniversity of ColoradoBoulderUSA

Personalised recommendations