Abstract
Predicate logic can be understood as an extension of propositional logic. The additional new concepts include quantifiers, function symbols and predicate symbols. These new notions allow us to describe assertions which cannot be expressed with the available tools of propositional logic. For example, up to this point it was not possible to express that certain “objects” stand in certain relations, or that a property holds for all such objects, or that some object with a certain property exists. Here is a well known example from calculus: For all ε > 0 there exists some n0, such that for all n ≥ n0, abs(f(n) − a) < ε. The main concepts here are the verbal constructs for all and exists, as well as the use of functions (abs, f, −) and relations (>, ≥, <).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Birkhäuser Boston
About this chapter
Cite this chapter
(2008). Predicate Logic. In: Logic for Computer Scientists. Progress in Mathematics, vol 8. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4763-6_3
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4763-6_3
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4762-9
Online ISBN: 978-0-8176-4763-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)