Introductory Logic PHI 120 Presentation: "Truth Tables – Validity vs. Soundness" This PowerPoint Presentation contains a large number of slides, a good.

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
Advertisements

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.
Constructing a Truth Table
Logic & Critical Reasoning
Propositional Logic Lecture 10: Oct 29.
Truth Tables Presented by: Tutorial Services The Math Center.
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
TF truth, falsity, and indeterminacy P is truth-functionally true iff it has the value T for any truth-value assignment. P is truth-functionally false.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1. 2 Day 1Intro Day 2Chapter 1 Day 3Chapter 2 Day 4Chapter 3 Day 5Chapter 4 Day 6Chapter 4 Day 7Chapter 4 Day 8EXAM #1 40% of Exam 1 60% of Exam 1 warm-up.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
The semantics of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of truth-value assignments   A truth-value assignment:
Snick  snack CPSC 121: Models of Computation 2010/11 Winter Term 2 Propositional Logic, Continued Steve Wolfman, based on notes by Patrice Belleville.
Propositional Logic USEM 40a Spring 2006 James Pustejovsky.
Propositional Logic Lecture 1: Sep 2. Content 1.Mathematical proof (what and why) 2.Logic, basic operators 3.Using simple operators to construct any operator.
Phil 120 week 1 About this course. Introducing the language SL. Basic syntax. Semantic definitions of the connectives in terms of their truth conditions.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Homework 3.
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
Logic ChAPTER 3.
Validity: Long and short truth tables Sign In! Week 10! Homework Due Review: MP,MT,CA Validity: Long truth tables Short truth table method Evaluations!
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Propositional Logic.
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Valid and Invalid Arguments
Black-Box Testing Techniques II Prepared by Stephen M. Thebaut, Ph.D. University of Florida Software Testing and Verification Lecture 5.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
DISCRETE STRUCTURE Bs (IT).
Logic Review. FORMAT Format Part I 30 questions 2.5 marks each Total 30 x 2.5 = 75 marks Part II 10 questions Answer only 5 of them! Total 5 x 5 marks.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.2 Truth Tables.
3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)
Chapter 7 Logic, Sets, and Counting
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
CS1022 Computer Programming & Principles Lecture 1 Logic and Proof.
How do I show that two compound propositions are logically equivalent?
Review Given p: Today is Thursday q: Tomorrow is Friday
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Logical Form and Logical Equivalence M Logical Form Example 1 If the syntax is faulty or execution results in division by zero, then the program.
Formal Test for Validity. EVALUATIONS Evaluations An evaluation is an assignment of truth-values to sentence letters. For example: A = T B = T C = F.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
Metalogic. TWO CONCEPTIONS OF LOGICAL CONSEQUENCE.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
3/6/20161 Let’s get started with... Logic !. 3/6/20162 Logic Crucial for mathematical reasoningCrucial for mathematical reasoning Used for designing electronic.
Introductory Logic PHI 120 Presentation: "Truth Tables – Sentences"
Welcome to Interactive Chalkboard Glencoe Geometry Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Developed by FSCreations, Inc.,
CS 106 Logic and Conditionals (Boolean Expressions)
Assign Yourself and Do Now Thursday, January 10, 2013.
Chapter 1 Logic and proofs
TF truth, falsity, and indeterminacy P is truth-functionally true iff it has the value T for any truth-value assignment. P is truth-functionally false.
Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction
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.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Introductory Logic PHI 120
Introductory Logic PHI 120
6.4 Truth Tables for Arguments
Presentation transcript:

Introductory Logic PHI 120 Presentation: "Truth Tables – Validity vs. Soundness" This PowerPoint Presentation contains a large number of slides, a good many of which are nearly identical. If you print this Presentation, I recommend six or nine slides per page.

Homework 1.Study Allen/Hand Logic Primer – Sec. 1.1, p. 2: “soundness” – Sec. 2.2, p. 45, “incompatible premises” 2.Ex. 2.2: i-xii

VALIDITY vs. SOUNDNESS P & Q, ~P ⊢ R Validity: An argument is valid if and only if: if all of its premises are true its conclusion is true. Validity: An argument is valid if and only if: if all of its premises are true its conclusion is true. Corollary: It is impossible for a valid argument to have: all true premises false conclusion Corollary: It is impossible for a valid argument to have: all true premises false conclusion

Validity vs. Soundness Valid Argument No invalidating assignment Criteria of a Sound Argument 1.argument is valid and 2.all premises are True. Valid but Unsound  no invalidating assignment  not all premises true Invalidating Assignment (1) conclusion is False (2) all premises are True Invalidating Assignment (1) conclusion is False (2) all premises are True

Incompatible Premises PQRP&R,~P ⊢ Q

PQRP&R,~P ⊢ Q Atomic statements MUST be written in alphabetical order

Incompatible Premises PQRP&R,~P ⊢ Q

PQRP&R,~P ⊢ Q T T T T F F F F

PQRP&R,~P ⊢ Q TT TT TF TF FT FT FF FF

PQRP&R,~P ⊢ Q TTT TTF TFT TFF FTT FTF FFT FFF

PQRP&R,~P ⊢ Q TTT TTF TFT TFF FTT FTF FFT FFF

PQRP&R,~P ⊢ Q TTT TTF TFT TFF FTT FTF FFT FFF

PQRP&R,~P ⊢ Q TTTF TTFF TFTF TFFF FTTT FTFT FFTT FFFT

PQRP&R,~P ⊢ Q TTTF TTFF TFTF TFFF FTTT FTFT FFTT FFFT

PQRP&R,~P ⊢ Q TTTF TTFFF TFTF TFFF FTTT FTFT FFTT FFFT

PQRP&R,~P ⊢ Q TTTF TTFFF TFTF TFFFF FTTT FTFT FFTT FFFT

PQRP&R,~P ⊢ Q TTTF TTFFF TFTF TFFFF FTTFT FTFT FFTT FFFT

PQRP&R,~P ⊢ Q TTTF TTFFF TFTF TFFFF FTTFT FTFFT FFTT FFFT

PQRP&R,~P ⊢ Q TTTF TTFFF TFTF TFFFF FTTFT FTFFT FFTFT FFFT

PQRP&R,~P ⊢ Q TTTF TTFFF TFTF TFFFF FTTFT FTFFT FFTFT FFFFT

PQRP&R,~P ⊢ Q TTTTF TTFFF TFTTF TFFFF FTTFT FTFFT FFTFT FFFFT

PQRP&R,~P ⊢ Q TTTTF TTFFF TFTTF TFFFF FTTFT FTFFT FFTFT FFFFT Testing for Validity: Find the Invalidating Assignment

Incompatible Premises PQRP&R,~P ⊢ Q TTTTF TTFFF TFTTF TFFFF FTTFT FTFFT FFTFT FFFFT

PQRP&R,~P ⊢ Q TTTTF TTFFF TFTTFF TFFFF FTTFT FTFFT FFTFT FFFFT

PQRP&R,~P ⊢ Q TTTTF TTFFF TFTTF TFFFFF FTTFT FTFFT FFTFT FFFFT

PQRP&R,~P ⊢ Q TTTTF TTFFF TFTTF TFFFF FTTFT FTFFT FFTFTF FFFFT

PQRP&R,~P ⊢ Q TTTTF TTFFF TFTTF TFFFF FTTFT FTFFT FFTFT FFFFTF

PQRP&R,~P ⊢ Q TTTTF TTFFF TFTTF TFFFF FTTFT FTFFT FFTFT FFFFT No Invalidating Assignment So the argument is valid Incompatible Premises

PQRP&R,~P ⊢ Q TTTTF TTFFF TFTTF TFFFF FTTFT FTFFT FFTFT FFFFT

Validity vs. Soundness Valid Argument Impossible for conclusion to be False and all premises True Sound Argument An argument is sound if and only if it is valid and all its premises are true. Valid but Unsound  No invalidating assignment  Not all premises true

SEQUENTS Truth Tables Determine truth-values of: 1.atomic statements 2.negations of atomics 3.inside parentheses 4.negation of the parentheses 5.any remaining connectives Determine truth-values of: 1.atomic statements 2.negations of atomics 3.inside parentheses 4.negation of the parentheses 5.any remaining connectives

Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency. ~P, R v ~P P v Q ⊢ ~Q First, identify the governing connectives.

~P, R v ~P P v Q ⊢ ~Q First, identify the governing connectives. Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q First, identify the governing connectives. Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, (R v ~P) (P v Q) ⊢ ~Q The second premise is a complex binary: Φ Ψ Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q The conclusion is a negation. Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

CONSTRUCT THE TRUTH TABLE Truth Tables – Sequents

~P, R v ~P P v Q ⊢ ~Q Determine the number of rows for the sequent 2 3 simple statements = 8 rows

~P, R v ~P P v Q ⊢ ~Q ~P,Rv~P PvQ ⊢ ~Q _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q _ __ Valid ____ Invalid Alphabetical Sequence! Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q T T T T F F F F _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TT TT TF TF FT FT FF FF _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTT TTF TFT TFF FTT FTF FFT FFF _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFF TTFFF TFTFF TFFFF FTTTT FTFTT FFTTT FFFTT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFFF TTFFFF TFTFFT TFFFFT FTTTTF FTFTTF FFTTTT FFFTTT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFFF TTFFFF TFTFFT TFFFFT FTTTTF FTFTTF FFTTTT FFFTTT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency. (R v ~P) (P v Q)

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFFF TTFFFFF TFTFFT TFFFFFT FTTTTF FTFTTF FFTTTT FFFTTT _ __ Valid ____ Invalid (R v ~P) (P v Q) Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFFF TTFFFFF TFTFFT TFFFFFT FTTTTF FTFTTF FFTTTT FFFTTT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFF TTFFFFF TFTFTFT TFFFFFT FTTTTTF FTFTTTF FFTTTTT FFFTTTT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFF TTFFFFF TFTFTFT TFFFFFT FTTTTTF FTFTTTF FFTTTTFT FFFTTTFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFF TTFFFFF TFTFTFT TFFFFFT FTTTTTF FTFTTTF FFTTTTFT FFFTTTFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTF TTFFFFTF TFTFTFTT TFFFFFTT FTTTTTTF FTFTTTTF FFTTTTFT FFFTTTFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTF TTFFFFFTF TFTFTFTT TFFFFFFTT FTTTTTTF FTFTTTTF FFTTTTFFT FFFTTTFFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTF TTFFFFFTF TFTFTFTT TFFFFFFTT FTTTTTTF FTFTTTTF FFTTTTFFT FFFTTTFFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTTF TTFFFFFTF TFTFTFTTT TFFFFFFTT FTTTTTTTF FTFTTTTTF FFTTTTFFT FFFTTTFFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTTF TTFFFFFTF TFTFTFTTT TFFFFFFTT FTTTTTTTF FTFTTTTTF FFTTTTFFT FFFTTTFFT _ __ Valid ____ Invalid Testing for Validity: Find the Invalidating Assignment Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTTF TTFFFFFTF TFTFTFTTT TFFFFFFTT FTTTTTTTF FTFTTTTTF FFTTTTFFT FFFTTTFFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTTF TTFFFFFTF TFTFTFTTT TFFFFFFTT FTTTTTTTF FTFTTTTTF FFTTTTFFT FFFTTTFFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTTF TTFFFFFTF TFTFTFTTT TFFFFFFTT FTTTTTTTF FTFTTTTTF FFTTTTFFT FFFTTTFFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTTF TTFFFFFTF TFTFTFTTT TFFFFFFTT FTTTTTTTF FTFTTTTTF FFTTTTFFT FFFTTTFFT _ __ Valid ____ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTTF TTFFFFFTF TFTFTFTTT TFFFFFFTT FTT T TT T T F FTFTTTTTF FFTTTTFFT FFFTTTFFT _ __ Valid _ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTTF TTFFFFFTF TFTFTFTTT TFFFFFFTT FTTTTTTTF FTFTTTTTF FFTTTTFFT FFFTTTFFT TautologyInconsistencyContingency _ __ Valid _ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

~P, R v ~P P v Q ⊢ ~Q PQR~P,Rv~P PvQ ⊢ ~Q TTTFTFTTF TTFFFFFTF TFTFTFTTT TFFFFFFTT FTTTTTTTF FTFTTTTTF FFTTTTFFT FFFTTTFFT TautologyInconsistencyContingency _ __ Valid _ Invalid Truth Tables Directions: (i) Construct a Truth Table in the grids provided. (ii) Circle the governing connective in each sentence. (iii) If the sequent is invalid, circle the invalidating assignment and check the line which reads INVALID. If the sequent is valid, check the line which reads VALID. (iv) In the space provided, identify what kind of truth value the conclusion has: Tautology, Inconsistency, or Contingency.

Homework 1.Study Allen/Hand Logic Primer – Sec. 1.1, p. 2: “soundness” – Sec. 2.2, p. 45, “incompatible premises” 2.Ex. 2.2: i-xii