Skip to main content
SpringerLink
Log in

Rudiments of First-Order Logic (FO)

  • Chapter
  • First Online:
Logic: Reference Book for Computer Scientists

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 245))

  • 110 Accesses

Abstract

In this chapter we present basic results on the second classical logic, first-order logic in many topics discussed here reduced to the predicate logic, i.e, logic without function symbols, yet with the full power of FO when deepest results like the Gödel completeness theorem, Gödel incompleteness theorems, the Rosser incompleteness theorem, and the Tarski theorem on non-definability of truth are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Tarski, A.: Der Wahrheitsbegriff in den formalisierten Sprachen. Stud. Philos. 1, 261–405 (1936). (Also in: Tarski, A.: Logic, Semantics, Metamathematics. Oxford University Press (1956, 1983))

    Google Scholar 

  2. Gentzen, G.: Untersuchungen über das Logische Schliessen. Math. Z. 39(176–210), 405–431 (1934)

    MATH  Google Scholar 

  3. Jaśkowski, S.: Teoria dedukcji oparta na dyrektywach założeniowych (in Polish) (Theory of deduction based on suppositional directives). In: Ksiȩga Pamia̧tkowa I Polskiego Zjazdu Matematycznego. Uniwersytet Jagielloński, Kraków (1929)

    Google Scholar 

  4. Jaśkowski, S.: On the rules of suppositions in formal logic. Stud. Logica 1, 5–32 (1934). (Also in: Storrs McCall (ed.). Polish Logic 1920–1939. Oxford U. P., 232–258 (1967))

    Google Scholar 

  5. Indrzejczak, A.: Sequents and Trees. Springer Nature Switzerland, Cham, Switzerland (2021)

    Book  MATH  Google Scholar 

  6. Smullyan, R.M.: First Order Logic. Dover, Minneola N.Y (1996)

    MATH  Google Scholar 

  7. Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics. Polish Scientific Publishers (PWN). Warsaw (1963)

    Google Scholar 

  8. Beth, E.W.: The Foundations of Mathematics: A Study in the Philosophy of Science. Harper & Row Publishers, New York (1966)

    Google Scholar 

  9. Hintikka, K.J.J.: Form and content in quantification theory. Acta Philosophica Fennica 8, 7–55 (1955)

    MathSciNet  MATH  Google Scholar 

  10. Löwenheim, L.: Über möglichkeiten im Relativkalkül. Math. Ann. 76(4), 447–470 (1915). https://doi.org/10.1007/bf01458217. (Also in: Van Heijenoort,J. (ed.): From Frege to Gödel. A Source Book in Mathematical Logic, 1879-1931, pp. 228–251. Harvard U. Press, Cambridge MA (1967))

  11. Skolem, T.A.: Logico-combinatorial investigations in the satisfiability or provability of mathematical propositions: A simplified proof of a theorem by L. Löwenheim and generalizations of the theorem. In: Van Heijenoort, J. (ed.) From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931, pp. 252–263. Harvard University Press, Cambridge MA (1967)

    Google Scholar 

  12. Skolem, T.A.: Selected Works in Logic. Universitetsforlaget, Oslo (1970)

    MATH  Google Scholar 

  13. Boolos, G.S., Burgess, J.P., Jeffrey, R.C.: Computability and Logic. Cambridge University Press, Cambridge UK (2002)

    Book  MATH  Google Scholar 

  14. Robinson, J.A.: A machine oriented logic based on the resolution principle. J. ACM 12(1), 23–41 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  15. Baader, F., Snyder, W., Narendran, P., Schmidt-Schauss, M., Schulz, K.: Unification theory. In: Robinson, A., Voronkov, A. (eds.): Handbook of Automated Reasoning, vol. 1, Ch. 8, pp. 447–533. Elsevier, Amsterdam (2001)

    Google Scholar 

  16. Horn, A.: On sentences which are true of direct unions of algebras. J. Symb. Log. 16(1), 14–21 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  17. Schöning, U.: Logic for Computer Scientists. Springer Science+Business Media, New York (1989)

    MATH  Google Scholar 

  18. Gallier, J.H.: Logic for Computer Science. Foundations of Automatic Theorem Proving. Longman (2003)

    Google Scholar 

  19. Russell, S., Norvig, P.: Artificial Intelligence. A Modern Approach, 4th edn. Pearson (2020)

    Google Scholar 

  20. Salomaa, A.: Formal Languages. Academic Press, New York (1973)

    MATH  Google Scholar 

  21. Church, A.: An unsolvable problem of elementary number theory. Am. J. Math. 58, 345–363 (1936)

    Article  MathSciNet  MATH  Google Scholar 

  22. Floyd, R.W.: in [Manna, 2-1.6]

    Google Scholar 

  23. Manna, Z.: Mathematical Theory of Computation. McGraw-Hill, New York (1974)

    MATH  Google Scholar 

  24. Post, E.: A variant of a recursively unsolvable problem. Bull. Am. Math. Soc. 52 (1946)

    Google Scholar 

  25. Scott, D.: Outline of Mathematical Theory of Computation. In: 4th Annual Princeton Conference on Information Sciences & Systems, pp. 169–176 (1970)

    Google Scholar 

  26. Friedman, J.: Lecture Notes on Foundations of Computer Science. Technical Report CS 99, Stanford University (1968)

    Google Scholar 

  27. Sipser, M.: Introduction to Theory of Computation. PWS Publ. Co., Boston MA (1977)

    MATH  Google Scholar 

  28. Herbrand, J.: Logical Writings. Harvard University Press, Cambridge MA (1971)

    Book  MATH  Google Scholar 

  29. Fitting, M.: First-Order Logic and Automated Theorem Proving. Springer, New York (1996)

    Book  MATH  Google Scholar 

  30. Gödel, K.: Die Vollständigkeit der Axiome des logischen Funktionenkalküls. Monatshefte für Mathematik und Physik 37, 349–360 (1930)

    Article  MathSciNet  MATH  Google Scholar 

  31. Henkin, L.: The completeness of the first-order functional calculus. J. Symb. Log. 14, 159–166 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  32. Hasenjaeger, G.: Eine Bemerkung zu Henkin’s Beweis für die Vollständigkeit des Prädikatenkalküls der ersten Stufe. J. Symb. Log. 18(1), 42–48 (1953). https://doi.org/10.2307/2266326

    Article  MathSciNet  MATH  Google Scholar 

  33. Church, A.: Introduction to Mathematical Logic. Princeton University Press, Princeton NJ (1956)

    MATH  Google Scholar 

  34. Smullyan, R.M.: Gödel’s Incompleteness Theorems. Oxford University Guides. Oxford University Press, New York-Oxford (1992)

    Book  MATH  Google Scholar 

  35. Quine, W.V.O.: Concatenation as basis for Arithmetic. J. Symb. Logic 11, 105–114 (1946)

    Google Scholar 

  36. Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und Verwandter Systeme 1. Monatshefte für Mathematik und Physics 38, 173–198 (1931)

    Article  MATH  Google Scholar 

  37. Kalish, D., Montague, R.: On Tarski ’s Formalization of predicate logic with identity. Arch. f. Math. Logik und Grundl. 7, 81–101 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  38. Rosser, J.B.: Extensions of some theorems of Gödel and Church. J. Symb. Log. 1(3), 87–91 (1936). https://doi.org/10.2307/2269028

    Article  MATH  Google Scholar 

  39. Robinson, R.: An essentially undecidable axiom system. Proc. Int. Congress Math. 1, 729–730 (1950)

    Google Scholar 

  40. Ehrenfeucht, A.: An application of games to the completeness problem for formalized theories. Fundam. Math. 49, 129–141 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  41. Fraïssé, R.: Sur quelques classifications des systémes de relations. Université d’lger, Publications Scientifiques, Séerie A 1, 35–182 (1954)

    Google Scholar 

  42. Mendelson, E.: Introduction to Mathematical Logic. CRC Press. Taylor and Francis Group, Boca Raton FL (2015)

    Book  MATH  Google Scholar 

  43. Craig, W.: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symb. Logic 22(3), 269–285 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  44. Halvorson, H.: https://www.princeton.edu/hhalvors/teaching/phi312_s2013/craig.pdf

  45. Chang, C.C., Keisler, J.H.: Model Theory. Elsevier Science Publication, Amsterdam (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Informatics, University of Warmia and Mazury, Olsztyn, Poland

    Lech T. Polkowski

Authors
  1. Lech T. Polkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lech T. Polkowski .

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Polkowski, L.T. (2023). Rudiments of First-Order Logic (FO). In: Logic: Reference Book for Computer Scientists. Intelligent Systems Reference Library, vol 245. Springer, Cham. https://doi.org/10.1007/978-3-031-42034-4_3

Download citation

Publish with us

Policies and ethics

Search

Navigation