Skip to main content

First-Order Logic

  • Chapter
Book cover The Calculus of Computation
  • 6223 Accesses

Abstract

This chapter extends the machinery of propositional logic to first-order logic (FOL), also called both predicate logic and the first-order predicate calculus. While first-order logic enjoys a degree of expressiveness that makes it suitable for reasoning about computation, it does not admit completely automated reasoning.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 79.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographic Remarks

  1. A. Church. A note on the Entscheidungsproblem. Journal of Symbolic Logic, 1, 1936.

    Google Scholar 

  2. K. Gödel. Über die Vollständigkeit des Logikkalküls. PhD thesis, University of Vienna, 1929.

    Google Scholar 

  3. K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38:173–198, 1931.

    Article  MATH  Google Scholar 

  4. D. Hilbert. Die Grundlagen der Mathematik. Abhandlungen aus dem Seminar der Hamburgischen Universität, 6:65–85, 1928.

    Google Scholar 

  5. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Automata Theory, Languages, and Computation. Addison-Wesley, 3rd edition, 2006.

    Google Scholar 

  6. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1993.

    Google Scholar 

  7. M. Sipser. Introduction to the Theory of Computation. Course Technology, 1996.

    Google Scholar 

  8. R. M. Smullyan. First-Order Logic. Dover, 1968.

    Google Scholar 

  9. R. Zach. Hilbert’s program. In E. N. Zalta, editor, The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Fall 2003. http://plato.stanford.edu/archives/fall2003/entries/hilbert-program.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2007). First-Order Logic. In: The Calculus of Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74113-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74113-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74112-1

  • Online ISBN: 978-3-540-74113-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics