CPSC 121 Lecture Notes - Lecture 4: Modus Ponens, Propositional Calculus, Atomic Formula
CPSC 121 verified notes
4/12View all
Document Summary
Predicate is what"s left when you throw out the subject. Epp : predicate is a sentence that has a finite number of variables, which becomes a proposition when specifci values are assigned to these variables. Letting x = bruce then we get the propositions (false) P(x,y) = x is rich and has a friend y in high places. X inputs, algorithm a terminates with input x . {things} the things are called elements of the set. We begin with a set of axioms (or hypotheses) a1 . an, and using the rules of inference. Then we construct a sequence of expressions that follow from those axioms. We can use the rules of inference from propositional logic as inference rules in predicate logic: We require that each hypothesis and line in the proof be a closed expression (ie, there are no free variables whose scope extends beyond a line in the proof)
