Statement Logic

# Statement Logic - I. Well-formed formulae a. Calculating...

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

I. Well-formed formulae a. Calculating truth values of compound statements i. Atomic Statements—single statements, ex “Abe Lincoln was a president” ii. Compound statements—statements with 2 or more parts, ex “Abe Lincoln was a president, and Obama is a lawyer” 1. Negation turns atomic statements into compound statements, ex “It is not the case that Obama is a lawyer” or simply even “Obama is not a lawyer” 2. “And” often acts as an operator, joining 2 statements into 1 compound statement, however not always, ex “Peanut Butter and jelly taste good together” in which case and would not be an operator b. Operators i. Must have 2 objects within a corresponding set of parentheses, however numerous objects bound by a single set of parentheses may count as 1 object 1. Ex: (((P->Q)v(A·B))<->Z) is a WFF ii. Lower case letters (p, q) are ways of describing WFF’s, but do not actually stand in for statements as capital letters do iii. ~p means “not p”, thus reverses the truth value of a statement

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.

## This note was uploaded on 05/07/2011 for the course PHIL 201 taught by Professor Peterhodges during the Fall '08 term at Boise State.

### Page1 / 2

Statement Logic - I. Well-formed formulae a. Calculating...

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

View Full Document
Ask a homework question - tutors are online