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.

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.
Software Testing Logic Coverage. Introduction to Software Testing (Ch 3) © Ammann & Offutt 2 Logic Coverage Four Structures for Modeling Software Graphs.
Tutorial 1: Logic Peter Poon. Self Introduction You can call me Peter Office: SHB117 Office hour:
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
2/17/2008Sultan Almuhammadi1 ICS Logic & Sets (An Overview) Week 1.
Boolean Algebra Computer Science AND (today is Monday) AND (it is raining) (today is Monday) AND (it is not raining) (today is Friday) AND (it is.
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.
Proving the implications of the truth functional notions  How to prove claims that are the implications of the truth functional notions  Remember that.
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.
Introduction to Software Testing Chapter 8.2
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.
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
Phil 120 week 1 About this course. Introducing the language SL. Basic syntax. Semantic definitions of the connectives in terms of their truth conditions.
Predicate Logic. Goal of Logic The goal of logic is to develop formal tests for validity. This is done by finding deductively valid argument forms. In.
Homework 3.
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!
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.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
LDK R Logics for Data and Knowledge Representation Exercise 2: PL, ClassL, Ground ClassL.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Valid and Invalid Arguments
Reason and Argument Chapter 6 (2/3). A symbol for the exclusive ‘or’ We will use ұ for the exclusive ‘or’ Strictly speaking, this connective is not necessary.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
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.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt
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)
Boolean Algebra. Logical Statements A proposition that may or may not be true:  Today is Monday  Today is Sunday  It is raining.
Boolean Logic. Boolean Operators (T/F) xyx AND y FFF FTF TFF TTT xyx OR y FFF FTT TFT TTT xNOT x FT TF.
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Conditional Statements
CS1022 Computer Programming & Principles Lecture 1 Logic and Proof.
Warmup Answer the following True/False questions in your head: I have brown hair AND I am wearing glasses I am male OR I am wearing sneakers I am NOT male.
How do I show that two compound propositions are logically equivalent?
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.
Boolean Algebra Monday/Wednesday 7th Week. Logical Statements Today is Friday AND it is sunny. Today is Friday AND it is rainy. Today is Monday OR it.
Introductory Logic PHI 120 Presentation: "Truth Tables – Validity vs. Soundness" This PowerPoint Presentation contains a large number of slides, a good.
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.
Boolean Logic.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt
Statement Forms and Material Equivalence Kareem Khalifa Department of Philosophy Middlebury College.
Metalogic. TWO CONCEPTIONS OF LOGICAL CONSEQUENCE.
1 Boolean Logic CS/APMA 202, Spring 2005 Rosen, section 1.1 Aaron Bloomfield.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
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.
Welcome to Interactive Chalkboard Glencoe Geometry Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Developed by FSCreations, Inc.,
Assign Yourself and Do Now Thursday, January 10, 2013.
Proposition symbols F = Dardar can fly B = Dardar is a bird P = Dardar is a plane S = Dardar is Superman.
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.
Test #2 Practice MGF 1106 Summer 2011.
Introduction to Software Testing Chapter 8.2
LOGICAL EQUIVALENCES - DISCRETE MATHEMATICS.
Presentation transcript:

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 iff it has the value F for any truth-value assignment. P is tf-false iff ~P is tf-true P is truth-functionally indeterminate iff it has the value T for some truth-value assignments, and the value F for some other truth-value assignments. P is tf-indeterminate iff it is neither tf-true nor th-false.

TF equivalence and consistency P and Q are truth-functionally equivalent iff P and Q do not have different truth-values for any truth-value assignment. A set of sentences is truth-functionally consistent iff there is a truth- value assignment that on which all the members of the set have the value T. A set of sentences is truth-functionally inconsistent iff it is not tf- consistent.

TF entailment and validity A set  of SL sentences truth-functionally entails a sentence P iff there is no truth-value assignment on which every member of  is true and P false.

TF entailment and validity A set  of SL sentences truth-functionally entails a sentence P iff there is no truth-value assignment on which every member of  is true and P false. An argument of SL is truth-functionally valid iff there is no truth- value assignment on which all the premises are true and the conclusion false.

TF entailment and validity A set  of SL sentences truth-functionally entails a sentence P iff there is no truth-value assignment on which every member of  is true and P false. An argument of SL is truth-functionally valid iff there is no truth- value assignment on which all the premises are true and the conclusion false. An argument of SL is truth-functionally invalid iff it is not tf-valid.

TF entailment and validity A set  of SL sentences truth-functionally entails a sentence P iff there is no truth-value assignment on which every member of  is true and P false. An argument of SL is truth-functionally valid iff there is no truth- value assignment on which all the premises are true and the conclusion false. An argument of SL is truth-functionally invalid iff it is not tf-valid. An argument is tf-valid iff the premises tf-entail the conclusion.

TF properties P is truth-functionally true iff it has the value T for any truth-value assignment. P is truth-functionally false iff ~P is tf-true. P is truth-functionally indeterminate iff P is neither tf-true nor tf-false. P and Q are truth-functionally equivalent iff P and Q do not have different truth- values for any truth-value assignment. A set of sentences is truth-functionally consistent iff there is a truth-value assignment that on which all the members of the set have the value T. A set  of SL sentences truth-functionally entails a sentence P iff there is no truth-value assignment on which every member of  is true and P false. An argument of SL is truth-functionally valid iff there is no truth-value assignment on which all the premises are true and the conclusion false.

3.2E 1j ~B  ((B  D)  TT TF FT FF

3.2E 1j ~B  ((B  D)  FTT FTF TFT TFF

3.2E 1j ~B  ((B  D)  FTTT FTTF TFT TFF

3.2E 1j ~B  ((B  D)  FTTT FTTF TFT TFFT

3.2E 1j ~B  ((B  D)  FTTT FTTF TFTTT TFFT

3.2E 1j ~B  ((B  D)  FTTT FTTF TFTTTT TFTFT

3.2E 1j ~B  ((B  D)  FT T T FT T F TF T TTT TF T FT

3.2E 1l (M  ~N)&(M  N) TT TF FT FF

3.2E 1l (M  ~N)&(M  N) T F T T T F F F T F T F

3.2E 1l (M  ~N)&(M  N) T FF T T TT F F TF T F FT F

3.2E 1l (M  ~N)&(M  N) T FF T T T TT F F F TF T F F FT F T

3.2E 1l (M  ~N)&(M  N) T FF T T T TT F F F TF T F F FT F T

3.2E 1l (M  ~N)&(M  N) T FF T F T T TT F F F F TF T F F F FT F F T

3.3E 1d (C&(B  A))  ((C&B)  A) TTT TTF TFT TFF FTT FTF FFT FFF

3.3E 1d (C&(B  A))  ((C&B)  A) TTT TTF TFT TFF FFTT FFTF FFFT FFFF

3.3E 1d (C&(B  A))  ((C&B)  A) TTT TTF TFT TFFF FFTT FFTF FFFT FFFF

3.3E 1d (C&(B  A))  ((C&B)  A) TTTT TTTF TFTT TFFF FFTT FFTF FFFT FFFF

3.3E 1d (C&(B  A))  ((C&B)  A) TTTTT TTTTF TTFTT TFFFF FFTT FFTF FFFT FFFF

3.3E 1d (C&(B  A))  ((C&B)  A) TTTTTT TTTTF TTFTTT TFFFF FFTTT FFTF FFFTT FFFF

3.3E 1d (C&(B  A))  ((C&B)  A) TTTTTT TTTTFT TTFTTT TFFFFF FFTTT FFTFF FFFTT FFFFF

3.3E 1d (C&(B  A))  ((C&B)  A) TTTTTT TTTTFTT TTFTTT TFFFFFF FFTTT FFTFFF FFFTT FFFFFF

3.3E 1d (C&(B  A))  ((C&B)  A) TTTTTT TTTTFTT TTFTTT TFFFFFF FFTTT FFTFFF FFFTT FFFFFF

3.3E 1d (C&(B  A))  ((C&B)  A) TTTTTT TTTTFTT TTFTTT TFFFFFF FFTT F T FFTFFF FFFTT FFFFFF

3.4E 1f U  (W&H)W  (U  H)H  ~H 1TTT 2TTF 3TFT 4TFF 5FTT 6FTF 7FFT 8FFF

3.4E 1f U  (W&H)W  (U  H)H  ~H 1T T TT T 2T T TF T 3T T FT F 4T T FF F 5F T TT T 6F F TF F 7F F FT F 8F F FF T

3.4E 1f U  (W&H)W  (U  H)H  ~H 1T T TT T T 2T T TF T T 3T T FT F T 4T T FF F T 5F T TT T T 6F F TF F T 7F F FT F T 8F F FF T T

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1 TTT 2 TTF 3 FTT 4 FTF 5 TFT 6 TFF 7 FFT 8 FFF

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTFTF 2TTTFF 3FTFTT 4FTTFT 5TFFTF 6TFTFF 7FFFTT 8FFTFT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTF 2TTTTFF 3FTFTT 4FTTFT 5TTFFTF 6TTFTFF 7FFFTT 8FFTFT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTF 2TTTTFF 3FTFFTT 4FTTTFT 5TTFFTF 6TTFTFF 7FFFFTT 8FFFTFT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTF 2TTTTFF 3FFTFFTT 4FTTTTFT 5TTFFTF 6TTFTFF 7FFFFFTT 8FFFFTFT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTF 2TTTTFTF 3FFTFFTT 4FTTTTFTT 5TTFFTF 6TTFTFTF 7FFFFFTT 8FFFFTFTT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTTF 2TTTTFTF 3FFTFFTTT 4FTTTTFTT 5TTFFTF 6TTFTFTF 7FFFFFTT 8FFFFTFTT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTTF 2TTTTFTF 3FFTFFTTT 4FTTTTFTT 5TTFFTFF 6TTFTFTF 7FFFFFTFT 8FFFFTFTT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTTTF 2TTTTFTTF 3FFTFFTTFT 4FTTTTFTFT 5TTFFTFFF 6TTFTFTTF 7FFFFFTFTT 8FFFFTFTFT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTTTFT 2TTTTFTTFT 3FFTFFTTFTT 4FTTTTFTFTT 5TTFFTFFF 6TTFTFTTF 7FFFFFTFTTT 8FFFFTFTFTT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTTTFT 2TTTTFTTFT 3FFTFFTTFTT 4FTTTTFTFTT 5TTFFTFFFF 6TTFTFTTFF 7FFFFFTFTTT 8FFFFTFTFTT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTTTFTT 2TTTTFTTFTT 3FFTFFTTFTTT 4FTTTTFTFTTT 5TTFFTFFFFT 6TTFTFTTFF 7FFFFFTFTTTT 8FFFFTFTFTT

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTTTFTT 2TTTTFTTFTT 3FFTFFTTFTTT 4FTTTTFTFTTT 5TTFFTFFFFT 6TTFTFTTFFF 7FFFFFTFTTTT 8FFFFTFTFTTF

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTTTFTFT 2TTTTFTTFTFT 3FFTFFTTFTTFT 4FTTTTFTFTTFT 5TTFFTFFFFFT 6TTFTFTTFFTF 7FFFFFTFTTTFT 8FFFFTFTFTTTF

3.5E1b B  (A  ~C)(C  A)  B~B  A~(A  C) 1TTTFTTTFTFT 2TTTTFTTFTFT 3FFTFFTTFTTFT 4FTTTTFTFTTFT 5TTFFTFFFFFT 6TTFTFTTFFTF 7FFFFFTFTTTFT 8FFFFTFTFTTTF

3.5E 1D ~(Y  A)~Y~AW&~W 1FTTTFFTFF 2FTTTFFFFT 3TTFFFTTFF 4TTFFFTFFT 5TFFTTFTFF 6TFFTTFFFT 7FFTFTTTFF 8FFTFTTFFT

shortened truth tables Show that ~B  (B&~B) is not tf-true

shortened truth tables Show that ~B  (B&~B) is not tf-true B~B  (B&~B) F

shortened truth tables Show that ~B  (B&~B) is not tf-true B~B  (B&~B) FFF

shortened truth tables Show that ~B  (B&~B) is not tf-true B~B  (B&~B) FTFF

shortened truth tables Show that ~B  (B&~B) is not tf-true B~B  (B&~B) TFTFTFT

shortened truth tables Show that ~B  (B&~B) is not tf-true B~B  (B&~B) TFTFTFFT

shortened truth tables Show that (~B  ~A)&C is not tf-false AB(~B  ~A)&B

shortened truth tables Show that (~B  ~A)&C is not tf-false AB(~B  ~A)&B T

shortened truth tables Show that (~B  ~A)&C is not tf-false AB(~B  ~A)&B TTT

shortened truth tables Show that (~B  ~A)&C is not tf-false AB(~B  ~A)&B TTTT

shortened truth tables Show that (~B  ~A)&C is not tf-false AB(~B  ~A)&B TTTTT

shortened truth tables Show that (~B  ~A)&C is not tf-false AB(~B  ~A)&B TFTTTT

shortened truth tables Show that (~B  ~A)&C is not tf-false AB(~B  ~A)&B TFTTTTT

shortened truth tables Show that (~B  ~A)&C is not tf-false AB(~B  ~A)&B FTFTTTFTT

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) T

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTT FTF

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTT TFFTTFF

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTT ?? T F F T T F F COTRADICTION!

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTT

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTTTT FTTTT FTFTT

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTTTT FTFTTTTTF FTFTT

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTTTT FTFTTT TTF FTFTT CONTRADICTION!

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTTTT FTFTT

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTTTTTTTT FTFTT

shortened truth tables Show that (A  B)  (B  A) is not tf-false AB(A  B)  (B  A) TTTTTTTTT

shortened truth tables Show that (A  B)  (B  A) is not tf-true AB(A  B)  (B  A) F

shortened truth tables Show that (A  B)  (B  A) is not tf-true AB(A  B)  (B  A) FFF

shortened truth tables Show that (A  B)  (B  A) is not tf-true AB(A  B)  (B  A) TFFFTFF

shortened truth tables Show that (A  B)  (B  A) is not tf-true AB(A  B)  (B  A) ??TFFFTFF CONTRADICTION! Therefore, the sentence is tf-true

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C)

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C T T T TT

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTT TT

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTTT T TTT T T

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTTT T TTTT T FT

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTTT T TTTT T FT B  (A&~C)(C  A)  B~B  A~(A  C) TTTF

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTTT T TTTT T FT B  (A&~C)(C  A)  B~B  A~(A  C) TTTFT

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTTT T TTTT T FT B  (A&~C)(C  A)  B~B  A~(A  C) TTTTTFT

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTTT T TTTT T FT B  (A&~C)(C  A)  B~B  A~(A  C) TTTTTTTFT

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTTT T TTTT T FT B  (A&~C)(C  A)  B~B  A~(A  C) TTTTTFTTFT

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTTT T TTTT T FT B  (A&~C)(C  A)  B~B  A~(A  C) TTTTTFFTTTTTTFTTF

shortened truth tables Practice Show that: {A  (B&C), B  (A  C), C  ~C} is tf-consistent {B  (A&~C), (C  A)  B, ~B  A}  ~(A  C) ABC A  (B&C)B  (A  C)C  ~C TTT T T TTTT T TTTT T FT B  (A&~C)(C  A)  B~B  A~(A  C) TTTTTFFTTTTFTTTFTTF