Argument Lecture 5.

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

Truth Tables and Logic Gates. What are Logic Gates? Logic gates are components used in making logic circuits. Each gate has one or more inputs and produces.
Logic Gates.
Programmable Logic Controllers.
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Through the Looking Glass, 1865
Adapted from Discrete Math
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
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.
Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
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.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Thinking Mathematically
Thinking Mathematically Arguments and Truth Tables.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Lecture 4 Boolean Algebra. Logical Statements °A proposition that may or may not be true: Today is Monday Today is Sunday It is raining °Compound Statements.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Module Code MA0003NI: Computing mathematics Lecture for Week Autumn.
Chapter 1 Propositional Logic
Discrete Mathematical
Truth Table to Statement Form
2. The Logic of Compound Statements Summary
Logic Gates.
Discrete Mathematics Lecture 1 Logic of Compound Statements
Discrete Mathematics Logic of Compound Statements
COMP 1380 Discrete Structures I Thompson Rivers University
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Principles of Computing – UFCFA3-30-1
CS100: Discrete structures
Applications of Propositional Logic
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
CS201: Data Structures and Discrete Mathematics I
JC Technology Logic Gates.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Logic Gates.
Applied Discrete Mathematics Week 1: Logic
TRUTH TABLES continued.
Discrete Mathematics Lecture # 8.
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics Logic.
Discrete Mathematics Lecture 2: Propositional Logic
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
Section 3.7 Switching Circuits
Truth tables Mrs. Palmer.
COMP 1380 Discrete Structures I Thompson Rivers University
1.3 Propositional Equivalences
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
3.5 Symbolic Arguments.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Presentation transcript:

Argument Lecture 5

Example An interesting teacher keeps me awake. I stay awake in XYZ class. Therefore, my XYZ teacher is interesting. Is the above argument valid?

Definition An argument is a sequence of declarative sentences One of which is intended as a conclusion The remaining sentences, the premises, are intended to prove or at least provide some evidence for the conclusion.

ARGUMENT: An argument is a list of statements called premises (or assumptions or hypotheses) followed by a statement called the conclusion. P1 Premise P2 Premise P3 Premise . . . . .. . . . . Pn Premise ______________ ∴C Conclusion

VALID AND INVALID ARGUMENT: An argument is valid if the conclusion is true when all the premises are true. Alternatively, an argument is valid if conjunction of its premises imply conclusion. That is (P1∧ P2 ∧ P3 ∧ . . . ∧ Pn) → C is a tautology. An argument is invalid if the conclusion is false when all the premises are true. Alternatively, an argument is invalid if conjunction of its premises does not imply conclusion.

EXAMPLE: Show that the following argument form is valid: p→q p ∴ q

EXAMPLE Show that the following argument form is invalid: p→q q ∴ p

EXERCISE: Use truth table to determine the argument form p ∨ q p → ~q p → r ∴ r is valid or invalid.

WORD PROBLEM If Tariq is not on team A, then Hameed is on team B. If Hameed is not on team B, then Tariq is on team A. ∴ Tariq is not on team A or Hameed is not on team B. SOLUTION Let t = Tariq is on team A , h = Hameed is on team B Then the argument is ~ t → h ~ h → t ∴ ~ t ∨ ~ h

EXERCISE If at least one of these two numbers is divisible by 6, then the product of these two numbers is divisible by 6. Neither of these two numbers is divisible by 6. ∴ The product of these two numbers is not divisible by 6.

EXERCISE If I got an Eid bonus, I’ll buy a stereo. If I sell my motorcycle, I’ll buy a stereo. ∴ If I get an Eid bonus or I sell my motorcycle, then I’ll buy a stereo

Applications of logic SWITCHES IN SERIES

SWITCHES IN PARALLEL:

SWITCHES IN SERIES:

SWITCHES IN PARALLEL:

NOT-gate A NOT-gate (or inverter) is a circuit with one input and one output signal. If the input signal is 1, the output signal is 0. Conversely, if the input signal is 0, then the output signal is 1.

2.AND-gate An AND-gate is a circuit with two input signals and one output signal. If both input signals are 1, the output signal is 1. Otherwise the output signal is 0.

OR-gate An OR-gate is a circuit with two input signals and one output signal. If both input signals are 0, then the output signal is 0. Otherwise, the output signal is 1

COMBINATIONAL CIRCUIT: A Combinational Circuit is a compound circuit consisting of the basic logic gates such as NOT, AND, OR.

DETERMINING OUTPUT FOR A GIVEN INPUT: Indicate the output of the circuit below when the input signals are P = 1, Q = 0 and R = 0

FINDING A BOOLEAN EXPRESSION FOR A CIRCUIT

CONSTRUCTING THE INPUT/OUTPUT TABLE FOR A CIRCUIT

CONSTRUCTING THE INPUT/OUTPUT TABLE FOR A CIRCUIT