Skip to main content

Part of the book series: Graduate Texts in Computer Science ((TCS))

  • 636 Accesses

Abstract

Over the years many fundamental and important results have been established for classical first-order logic. This chapter is devoted to what are probably the most basic of these, ranging from Herbrand’s theorem to Beth’s definability theorem. The Model Existence Theorem plays a role in establishing many of the results of this chapter, thus proving its versatility. It has one big drawback, though—proofs that use it are non-constructive in nature. For some of the things we are interested in, such as Herbrand’s theorem, it is important to have a constructive proof as well, and this leads us to the beginnings of proof theory, supplementing the semantic methods that we initially rely on.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Fitting, M. (1996). Further First-Order Features. In: First-Order Logic and Automated Theorem Proving. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2360-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2360-3_8

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7515-2

  • Online ISBN: 978-1-4612-2360-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics