Implication (6A) Young Won Lim 3/12/18

Similar documents
Propositional Logic (2A) Young W. Lim 11/8/15

Implication (6A) Young Won Lim 3/17/18

Propositional Logic Logical Implication (4A) Young W. Lim 4/11/17

Relations (3A) Young Won Lim 3/27/18

Propositional Logic Logical Implication (4A) Young W. Lim 4/21/17

Propositional Logic Arguments (5A) Young W. Lim 11/30/16

Propositional Logic Resolution (6A) Young W. Lim 12/12/16

Propositional Logic Resolution (6A) Young W. Lim 12/31/16

Propositional Logic Arguments (5A) Young W. Lim 10/11/16

First Order Logic Implication (4A) Young W. Lim 4/6/17

Propositional Logic Arguments (5A) Young W. Lim 11/8/16

Propositional Logic Arguments (5A) Young W. Lim 2/23/17

Resolution (7A) Young Won Lim 4/21/18

Logic Background (1A) Young W. Lim 5/14/18

The Growth of Functions (2A) Young Won Lim 4/6/18

Expected Value (10D) Young Won Lim 6/12/17

Higher Order ODE's (3A) Young Won Lim 7/7/14

Propositional Logic Arguments (5A) Young W. Lim 11/29/16

Higher Order ODE's (3A) Young Won Lim 12/27/15

Hamiltonian Cycle (3A) Young Won Lim 5/5/18

Propositional Logic Arguments (5B) Young W. Lim 11/30/16

Matrix Transformation (2A) Young Won Lim 11/10/12

Higher Order ODE's (3A) Young Won Lim 7/8/14

Detect Sensor (6B) Eddy Current Sensor. Young Won Lim 11/19/09

Root Locus (2A) Young Won Lim 10/15/14

Bayes Theorem (4A) Young Won Lim 3/5/18

General CORDIC Description (1A)

Background Trigonmetry (2A) Young Won Lim 5/5/15

CT Rectangular Function Pairs (5B)

Fourier Analysis Overview (0A)

First Order Logic Arguments (5A) Young W. Lim 2/24/17

DFT Frequency (9A) Each Row of the DFT Matrix. Young Won Lim 7/31/10

Differentiation Rules (2A) Young Won Lim 1/30/16

Separable Equations (1A) Young Won Lim 3/24/15

General Vector Space (2A) Young Won Lim 11/4/12

Matrix Transformation (2A) Young Won Lim 11/9/12

Logic Background (1A) Young W. Lim 12/14/15

Introduction to ODE's (0A) Young Won Lim 3/9/15

Bayes Theorem (10B) Young Won Lim 6/3/17

Signal Functions (0B)

First Order Logic Arguments (5A) Young W. Lim 3/10/17

Complex Trigonometric and Hyperbolic Functions (7A)

Discrete Time Rect Function(4B)

Fourier Analysis Overview (0A)

Higher Order ODE's, (3A)

Line Integrals (4A) Line Integral Path Independence. Young Won Lim 10/22/12

Capacitor Young Won Lim 06/22/2017

Discrete Time Rect Function(4B)

Capacitor and Inductor

Capacitor and Inductor

Fourier Analysis Overview (0B)

Signal Processing. Young Won Lim 2/20/18

Capacitor in an AC circuit

Dispersion (3A) 1-D Dispersion. Young W. Lim 10/15/13

Group & Phase Velocities (2A)

Differentiation Rules (2A) Young Won Lim 2/22/16

First Order Logic (1A) Young W. Lim 11/5/13

Propagating Wave (1B)

Magnetic Sensor (3B) Magnetism Hall Effect AMR Effect GMR Effect. Young Won Lim 9/23/09

Complex Series (3A) Young Won Lim 8/17/13

Sequential Circuit Timing. Young Won Lim 11/6/15

Down-Sampling (4B) Young Won Lim 10/25/12

Audio Signal Generation. Young Won Lim 1/29/18

Logic (3A) Young W. Lim 12/5/13

First Order Logic (1A) Young W. Lim 11/18/13

Linear Equations with Constant Coefficients (2A) Young Won Lim 4/13/15

ODE Background: Differential (1A) Young Won Lim 12/29/15

FSM Examples. Young Won Lim 11/6/15

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

General Vector Space (3A) Young Won Lim 11/19/12

Logic (3A) Young W. Lim 10/29/13

Definitions of the Laplace Transform (1A) Young Won Lim 1/31/15

Down-Sampling (4B) Young Won Lim 11/15/12

Digital Signal Octave Codes (0A)

Up-Sampling (5B) Young Won Lim 11/15/12

Complex Functions (1A) Young Won Lim 2/22/14

Line Integrals (4A) Line Integral Path Independence. Young Won Lim 11/2/12

Logic (3A) Young W. Lim 11/2/13

Logic (3A) Young W. Lim 10/31/13

Phasor Young Won Lim 05/19/2015

Probability (10A) Young Won Lim 6/12/17

Digital Signal Octave Codes (0A)

First Order Logic Semantics (3A) Young W. Lim 9/17/17

First Order Logic Semantics (3A) Young W. Lim 8/9/17

Definition 2. Conjunction of p and q

Signal Processing. Young Won Lim 2/22/18

Finite State Machine (1A) Young Won Lim 6/9/18

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

Digital Signal Octave Codes (0A)

Group Velocity and Phase Velocity (1A) Young Won Lim 5/26/12

Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.

Audio Signal Generation. Young Won Lim 2/2/18

Digital Signal Octave Codes (0A)

Signals and Spectra (1A) Young Won Lim 11/26/12

Bandpass Sampling (2B) Young Won Lim 3/27/12

Group Delay and Phase Delay (1A) Young Won Lim 7/19/12

Background LTI Systems (4A) Young Won Lim 4/20/15

Digital Signal Octave Codes (0A)

Introduction to ODE's (0P) Young Won Lim 12/27/14

CLTI System Response (4A) Young Won Lim 4/11/15

Transcription:

(6A)

Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License". Please send corrections (or suggestions) to youngwlim@hotmail.com. This document was produced by using LibreOffice and Octave.

Semantics of Rule (1) (2) (3) Suppose A B is true If A is true then B must be true Suppose A B is false If A is true then B must be false Suppose A B is true If A is false then we do not know whether B is true or false (1) (2) (3) A B A B T T T T F F F T T F F T 3

Material & Logical Given two propositions A and B, If A B is a tautology It is said that A logically implies B (A B) in every interpretation Material A B Logical A B (not a tautology) (a tautology) A B A B A B A B T T T T F F F T T F F T A B A B A B A T T T T T F F T F T F T F F F T tautology A B A 4

Logical consequences https://en.wikipedia.org/wiki/logical_consequence 5

Proofs and Models The two prevailing techniques for providing accounts of logical consequence involve expressing the concept via proofs models Logical Consequences syntactic consequence proof theory semantic consequence model theory https://en.wikipedia.org/wiki/logical_consequence 6

Syntactic vs Semantic Consequences https://en.wikipedia.org/wiki/logical_consequence 7

Syntactic Consequence Example A B A B T T T T F F F T T F F T No need models interpretations A B A B A B A T T T T T F F T F T F T F F F T Entailment A B A, or A B A syntactic consequence logical consequence 8

Semantic Consequence Example (1) Interpretation I1 Interpretation I2 Interpretation I3 Interpretation I4 A B A B T T T T F F F T T F F T But if we force the use of implications models Interpretation I1 Interpretation I2 Interpretation I3 Interpretation I4 A B A B A B A T T T T T F F T F T F T F F F T 9

Semantic Consequence Example (2) a Model of A a Model of A A B A B T T T T F F F T T F F T a Model of A B a Model of A B a Model of A B A B a Model of A B A B A B A B A T T T T T F F T F T F T F F F T a Model of A B A a Model of A B A a Model of A B A a Model of A B A Entailment A B A, or A B A syntactic consequence logical consequence 10

Entailment if A B holds in every model then A B, and conversely if A B then A B is true in every model any model that makes A B true also makes A true : A B No case : True False A A B A B T T T T F F F T T F F T A B A B A B A T T T T T F F T F T F T F F F T Entailment A B A, or A B A semantic consequence logical consequence 11

Logic and Venn diagram (1) S N S N T T T T F F F T T F F T S N 12

Logic and Venn diagram (2) p r q p q r p q T T T T T T F T T F T F T F F F F T T T F T F T F F T T F F F T 13

Material and Venn Diagram S N S N T T T T F F F T T F F T S N When S N is True S N S N S N 14

When S N is a true statement S N S N T T T T F F F T T F F T (1) (2) S N S N is True + + (1) (2) if the conditional statement (S N) is a true statement, then the consequent N must be true if S is true the antecedent S can not be true without N being true 15

S N if the conditional statement (S N) is a true statement, then the consequent N must be true if S is true S N S N + S N x S x N 16

~N ~S if the conditional statement (S N) is a true statement, the antecedent S can not be true without N being true N S N N S + N S x N x S 17

Material vs. Logical Consequence Material Logical Consequences S N S N S N S N T F exists Always True (Tautology) entailment S N S N syntactic (proof) semantic (model) 18

S N S N If S, then N. S implies N. N whenever S. S is sufficient for N. S only if N. not S if not N. not S without N. N is necessary S. http://en.wikipedia.org/wiki/ 19

Necessity and Sufficiency S N condition that guarantees N sufficiency for N S satisfies at least N N if S condition that must be satisfied for S necessity for S without N, it can t be S S only if N N S 20

Other Necessary Conditions requirement 2 S N Get A Term Paper submitted Midterm taken Get A Term Paper Final test taken Rank < 15% necessary conditions of S requirement 1 requirement n S only if N not S if not N http://philosophy.wisc.edu/hausman/341/skill/nec-suf.htm` 21

Other Sufficient Conditions S N Case 2 A on every work Get A Case 1 A on every work Get A Case 3 Case I Case n Case II sufficient conditions of N Term Paper necessary conditions of Get A N if S N whenever S http://philosophy.wisc.edu/hausman/341/skill/nec-suf.htm` 22

Necessity Definition Definition: A necessary condition for some state of affairs S is a condition that must be satisfied in order for S to obtain. a necessary condition for getting an A in 341 is that a student hand in a term paper. This means that if a student does not hand in a term paper, then a student will not get an A, or, equivalently, if a student gets an A, then a student hands in a term paper. http://philosophy.wisc.edu/hausman/341/skill/nec-suf.htm 23

Sufficiency Definition Definition: A sufficient condition for some state of affairs N is a condition that, if satisfied, guarantees that N obtains. a sufficient condition for getting an A in 341 is getting an A on every piece of graded work in the course. This means that if a student gets an A on every piece of graded work in the course, then the student gets an A. Handing in a term paper is not a sufficient condition for getting an A in the course. It is possible to hand in a term paper and not to get an A in the course. Getting an A on every piece of graded work is not a necessary condition for getting an A in the course. It is possible to get an A in the course even though one fails to get an A on some piece of graded work. http://philosophy.wisc.edu/hausman/341/skill/nec-suf.htm` 24

IF / Only IF "Madison will eat the fruit if it is an apple." "Only if Madison will eat the fruit, is it an apple;" "Madison will eat the fruit fruit is an apple" This states simply that Madison will eat fruits that are apples. It does not, however, exclude the possibility that Madison might also eat bananas or other types of fruit. All that is known for certain is that she will eat any and all apples that she happens upon. That the fruit is an apple is a sufficient condition for Madison to eat the fruit. cherry eat apple banana sufficient conditions boil eat apple sell necessary conditions http://en.wikipedia.org/wiki/derivative 25

IF / Only IF refuse apple eat sell apple : a necessary condition fish apple eat "Madison will eat the fruit only if it is an apple." "If Madison will eat the fruit, then it is an apple" "Madison will eat the fruit fruit is an apple" This states that the only fruit Madison will eat is an apple. It does not, however, exclude the possibility that Madison will refuse an apple if it is made available in contrast with (1), which requires Madison to eat any available apple. In this case, that a given fruit is an apple is a necessary condition for Madison eating it. It is not a sufficient condition since Madison might not eat all the apples she is given. bread eat : a sufficient condition http://en.wikipedia.org/wiki/derivative 26

IF / Only IF "Madison will eat the fruit if it is an apple." "Only if Madison will eat the fruit, is it an apple;" "Madison will eat the fruit fruit is an apple" This states simply that Madison will eat fruits that are apples. It does not, however, exclude the possibility that Madison might also eat bananas or other types of fruit. All that is known for certain is that she will eat any and all apples that she happens upon. That the fruit is an apple is a sufficient condition for Madison to eat the fruit. "Madison will eat the fruit only if it is an apple." "If Madison will eat the fruit, then it is an apple" "Madison will eat the fruit fruit is an apple" This states that the only fruit Madison will eat is an apple. It does not, however, exclude the possibility that Madison will refuse an apple if it is made available in contrast with (1), which requires Madison to eat any available apple. In this case, that a given fruit is an apple is a necessary condition for Madison eating it. It is not a sufficient condition since Madison might not eat all the apples she is given. apple eat eat apple http://en.wikipedia.org/wiki/derivative apple 27

IF / Only IF Madison will eat the fruit if it is an apple. Only if Madison will eat the fruit, is it an apple. If Madison will not eat the fruit, it is not an apple. fruit is an apple Madison will eat the fruit Madison will eat the fruit only if it is an apple. Madison will not eat the fruit, if it is not an apple. If Madison will eat the fruit, then it is an apple. Madison will eat the fruit fruit is an apple A E E A orange sell apple eat eat apple banana boil apple eat eat apple apple: a sufficient condition apple: a necessary condition http://en.wikipedia.org/wiki/derivative 28

IFF "Madison will eat the fruit if and only if it is an apple" "Madison will eat the fruit fruit is an apple" This statement makes it clear that Madison will eat all and only those fruits that are apples. She will not leave any apple uneaten, and she will not eat any other type of fruit. That a given fruit is an apple is both a necessary and a sufficient condition for Madison to eat the fruit. http://en.wikipedia.org/wiki/derivative 29

Necessary Condition (1) Definition: A condition that is necessary for a particular outcome to be achieved. The condition does not guarantee the outcome; but if the condition does not hold, the outcome will not achieved if the Cubs win the World Series, we can be sure that they signed a right-handed relief pitcher, since, without such a signing, they would not have won the World Series. N2 win signing Discrete Mathematics, Johnsonbaugh N3 30

Necessary Condition (2) if the Cubs win the World Series, we can be sure that they signed a right-handed relief pitcher, since, without such a signing, they would not have won the World Series. The equivalent statement: if the Cubs win the World Series, then they signed a right-handed relief pitcher The conclusion expresses a necessary condition N2 win signing Discrete Mathematics, Johnsonbaugh N3 31

Necessary Condition (3) if the Cubs win the World Series, we can be sure that they signed a right-handed relief pitcher, since, without such a signing, they would not have won the World Series. Not equivalent statement: if the Cubs sign a right-handed relief pitcher, then they win the World Series Signing a right-handed relief pitcher does not guarantee a World Series win. N2 However, not signing a right-handed relief pitcher guarantees that they will not win the World Series win signing Discrete Mathematics, Johnsonbaugh N3 32

Sufficient Condition (1) Definition: a condition that suffices to guarantee a particular outcome. If the condition does not hold, the outcome might be achieved in other ways or it might not be achieved at all; but If the condition does hold, the outcome guaranteed. To be sure that Maria visits France, it suffices for her to go to the Eiffel Tower. There are surely other ways to ensure that Maria visits France; for example, she could go to Lyon. Eiffel nantes France Lyon Discrete Mathematics, Johnsonbaugh sufficient conditions 33

Sufficient Condition (2) To be sure that Maria visits France, it suffices for her to go to the Eiffel Tower. There are surely other ways to ensure that Maria visits France; for example, she could go to Lyon. The equivalent statement: If Maria goes to the Eiffel Tower, then she visits France The hypothesis expresses a sufficient condition Eiffel nantes France Lyon Discrete Mathematics, Johnsonbaugh sufficient conditions 34

Sufficient Condition (3) To be sure that Maria visits France, it suffices for her to go to the Eiffel Tower. There are surely other ways to ensure that Maria visits France; for example, she could go to Lyon. Not equivalent statement: If Maria visits France, then she goes to the Eiffel Tower. There are ways other than going to the Eiffel Tower to ensure that Maria visits France Eiffel nantes France Lyon Discrete Mathematics, Johnsonbaugh sufficient conditions 35

in First Order Logic Every student in this class has studied Java. java class java class x (C(x) J (x)) class java Discrete Mathematics, Johnsonbaugh sufficient conditions 36

in First Order Logic Some student in this class has studied Java. java class java class class java x (C (x) J (x)) Discrete Mathematics and its Applications, Rosen sufficient conditions 37

To prove implications by contradiction P Q Assume this is false ( p q) p q Assume P is true and Q is false Derive contradiction P Q Discrete Mathematics and its Applications, Rosen 38

Indirect Proof contradiction p p q r F T T T F T T F F T F T F T F F T F T T T F T F T F F T T F F F p q T T F F T T T T p q F F T T F F F F r r F F F F F F F F ( p q) (r r) T T F F T T T T 39

References [1] http://en.wikipedia.org/ [2] http://web.stanford.edu/class/archive/cs/cs103/cs103.1132/lectures/02/small02.pdf