Abstract
This chapter discusses two questions: what is a proposition? and what are the conditions for a proposition to be true? It introduces the main concepts of predicate logic: that of a language and that of a proof in natural deduction. Then, it presents examples of theories (the theory of equality, the theory of classes, arithmetic, set theory, …). To be self contained this chapter introduces all the basic notions about inductive definitions and formal languages in general (variables, expressions, substitution, bound and free variables, sorts, …)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Dowek, G. (2011). Predicate Logic. In: Proofs and Algorithms. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-121-9_1
Download citation
DOI: https://doi.org/10.1007/978-0-85729-121-9_1
Publisher Name: Springer, London
Print ISBN: 978-0-85729-120-2
Online ISBN: 978-0-85729-121-9
eBook Packages: Computer ScienceComputer Science (R0)