handout1

# handout1 - ECS20 Handout 1 January 4 2011 1 A proposition...

This preview shows pages 1–2. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ECS20 Handout 1 January 4, 2011 1. A proposition is a statement that is either true (T) or false (F), but not both. Standard notation for a proposition: p , q , r , ... 2. New propositions, called compound proposition , are formed from existing propositions using logical operations 3. Four basic compound propositions: (a) Negation of p : ¬ p = “It is not the case that p ” (b) Conjunction of p and q : p ∧ q = “ p and q ” (c) Disjunction of p and q : p ∨ q = “ p or q ” (“inclusive or”) (d) Exclusive disconjunction of p and q : p ⊕ q = “this is true either p or q but not both are ture” Truth tables display the relationships between the true values of propositions: p ¬ p T F F T p q p ∧ q T T T T F F F T F F F F p q p ∨ q T T T T F T F T T F F F p q p ⊕ q T T F T F T F T T F F F 4. The Implication p → q is the proposition “if p then q ”, p is called hypothesis , and q is called the conclusion ....
View Full Document

## This note was uploaded on 05/31/2011 for the course ECS 20 taught by Professor Staff during the Winter '08 term at UC Davis.

### Page1 / 2

handout1 - ECS20 Handout 1 January 4 2011 1 A proposition...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online