Computer Science 2209A/B Lecture Notes - Lecture 4: If And Only If, Free Variables And Bound Variables, And1

• School: Western University
• Department: Computer Science
• Course: Computer Science 2209A/B
• Professor: Lila Kari

Document Summary

The language l pred of predicate calculus syntax pred. , the formal language of predicate calculus, consists of the following basic symbols: constant symbols: a, b, c, a. 1 connectives: , , , , quantifiers: , punctuation symbols: ( ) , There is a special binary relation symbol called the equality symbol, written as . L pred may or may not contain . pred: l containing. Is called the first order language with equality. 2 t n are terms of l pred. An expression of l pred is an atom in atom(l pred. ) iff it is of one of the following two forms: (1) f(t. ) where f is an n-ary predicate (relation symbol) andt. ), the class of formulas of l pred. , is the smallest class of expressions of l pred closed under the following formation rules: (1) every atom in atom(l pred. L (4) if a(u) is a formula of l pred.