6.3 Truth Tables for Propositions

Slides:



Advertisements
Similar presentations
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Advertisements

Chapter 21: Truth Tables.
Truth Tables How to Make and Use. Making a Truth Table To determine the number of rows other than the heading row. To determine the number of rows other.
Logic & Critical Reasoning
PROOF BY CONTRADICTION
1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
Formal Semantics of S. Semantics and Interpretations There are two kinds of interpretation we can give to wffs: –Assigning natural language sentences.
For Wednesday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C.
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
An Introduction to Propositional Logic Translations: Ordinary Language to Propositional Form.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
For Wed, read Chapter 3, section 3. Nongraded Homework: Exercises the end of the section. Even better, do Power of Logic, 7.3, A and B. Graded homework.
Copyright © Cengage Learning. All rights reserved.
Adapted from Discrete Math
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Propositions and Truth Tables
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
How do I show that two compound propositions are logically equivalent?
Thinking Mathematically
Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Propositional Logic – The Basics (2) Truth-tables for Propositions.
 To combine propositions using connectives  To construct the truth table of a given compound proposition  To define de Morgan Law for logic  To define.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Truth Tables, Continued 6.3 and 6.4 March 14th. 6.3 Truth tables for propositions Remember: a truth table gives the truth value of a compound proposition.
Logic.
Conditional Statements
Computer Science 210 Computer Organization
The Foundations: Logic and Proofs
DISCRETE MATHEMATICS CHAPTER I.
CHAPTER 3 Logic.
How do I show that two compound propositions are logically equivalent?
Truth Tables How to build them
6.1 Symbols and Translation
1.2 Propositional Equivalences
Propositional Equivalences
Computer Science 210 Computer Organization
4 Categorical Propositions
TRUTH TABLES.
The Logic of Declarative Statements
Truth tables 3.2 and 3.3 Constructing Truth tables
Logical Truth To show a statement A is a logic truth (tautology) ...
Deductive Arguments: More Truth Tables
1.2 Propositional Equivalences
Truth tables Construct a truth table for the following statements:
Propositional Logic 6.2 Truth Functions.
Statements of Symbolic Logic
TRUTH TABLES.
Introductory Logic PHI 120
Truth tables Mrs. Palmer.
1.2 Propositional Equivalences
Section 3.3 Truth Tables for the Conditional and Biconditional
6.4 Truth Tables for Arguments
1.3 Propositional Equivalences
CHAPTER 3 Logic.
2-2 Logic Part 2 Truth Tables.
CHAPTER 3 Logic.
Logical truths, contradictions and disjunctive normal form
Propositional Satisfiability
Presentation transcript:

6.3 Truth Tables for Propositions Propositional Logic 6.3 Truth Tables for Propositions

Truth Tables for Propositions The truth tables for the tilde, dot, wedge, etc., are all “truth tables for propositions.” Now we will apply a few new rules to show we can make truth tables for more complex propositions.

Truth Tables for Propositions Let’s take this example: (A v ~B)  B Since there are 2 different simple propositions, we need 4 lines to assess all the possible combinations of truth and falsity…

Truth Tables for Propositions (A v ~B)  B __________ Draw 4 lines T T T Enter TTFF, and TFTF T F F Since B appears again, we put TFTF in again F T T F F F

Truth Tables for Propositions (A v ~B)  B __________ Begin with the most enclosed operators and move out to the least enclosed Here, then, is the truth table for (A v ~B)  B T T T F T T F T T T F F F F T F T T F F T T F F

Classifying Statements If the main column has all Ts, the statement is said to be Logically true Tautologous Trivially true (true under all interpretations). [(G  H) • G]  H T

Classifying Statements If the main column has all Fs, the statement is said to be Logically false Self-contradictory Trivially false (false under all interpretations). (G v H) Ξ (~G • ~H) F

Classifying Statements If the main column has any mix of Ts and Fs, the statement is said to be Logically undetermined Contingent Empirical (true or false under various interpretations). (A v ~B)  B F T

Comparing Statements If two statements have the same truth values on each line of their truth tables, the statements are Logically Equivalent T F T F

Comparing Statements Opposite truth values on each line: Logically Contradictory T F F T

Comparing Statements At least one line has both true: Logically Consistent T F F T

Comparing Statements No line has both true: Logically Inconsistent T F