CS245 Study Guide - Propositional Formula, Propositional Calculus, Boolean Function
Document Summary
The alphabet of the language of propositional logic consists of the following symbols: propositional symbols: p, q, p1, p2, . , q1, q2, : logical connectives: , , , ; and, punctuation: ( and ) . (textbook 2. 2; page 19) We reserve certain symbols (often with subscripts) to denote certain classes of objects: I, j, . (lowercase greek letters) well formed formul (formul for short) (capital greek letters) sets of well formed formul interpretations (truth assignments) Let p be a set of propositional symbols. An interpretation is a function i : p {0, 1} that assigns true (1) or false (0) to every propositional symbol in p . (textbook 2. 4. 1; page 31) The satisfaction relation |= between an interpretation i and a well formed formula , written i |= (and i (cid:54)|= for not i |= ), is de ned as follows: An interpretation i such that i |= is called a model of .
