This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: EECS 203, Winter 2007 Discrete Mathematics Lecture 3 Firstorder logic continued January 11 Reading: Rosen [1.3, 1.4] January 11 Firstorder logic continued, Page 1 3.1 Review Vocabulary of a firstorder logic: constants, variables, functions , predicates (or relations ), connectives, quantifier , parenthesis, a special predicate =. Terms : a constant, variable, or f ( t 1 , , t n ) for some function f and terms t 1 , , t n . Wellformed formulas : 1. atomic formulas: P ( t 1 , , t n ) for some predicate P and terms t 1 , , t n . 2. constructed from wffs using connectives. 3. constructed from wffs using quantifiers: ( x ), ( x ). Free and bound variables : an occurrence of a variable x is free if it is not in the scope of a quantifier x or x . If not free, a variable is bound. A sentence is a wff if all variables are bound. January 11 Firstorder logic continued, Page 2 3.2 Models of a firstorder logic A model (or interpretation ) M for a first order logic...
View Full
Document
 Winter '07
 YaoyunShi

Click to edit the document details