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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights 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