28 - use the 5 basic truth tables to determine the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Notes: 10/28/10 A compound proposition is any prop with a connective in it. Or = v (DISJUCTION) NOT= ~ (NEGATION) IF THEN= (CONDITIONAL) IF AND ONLY IF= ↔ (BI-CONDITIONAL) When you ~ a proposition in the truth table you switch from T to F or F to T when constructing truth-tables Rule: The same variable can only be used for the same proposition Different variables can be used for either the same proposition or different propositions. I. Abbreviations of Propositions: to abbreviate propositions, we use CAPITAL letters, connective symbols and parentheses. II. Abbreviations versus Propositional Forms III. Computing the Truth-Values of Compounds Propositions a. If we know the truth-values of each part of a compound proposition, we can
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: use the 5 basic truth tables to determine the truth-value of the compound proposition. IV. A Method of Computing the Truth-Value of Complex Propositions a. Replace the abbreviations with their truth values b. Use the 5 truth tables to calculate the truth-value of the smallest compound proposition and work your way out. V. Constructing Truth-Tables for Complex Propositional Forms a. Under what conditions are instances of ~(p & ~q) v r true of false? b. We can use the truth-tables for the five connectives to develop a truth-table for this and other complex propositional forms c....
View Full Document

This note was uploaded on 03/03/2011 for the course PHIL 100 taught by Professor Forte during the Fall '08 term at Bridgewater State University.

Ask a homework question - tutors are online