Lecture 2 Discrete Mathematics 9/3/2015 1. Introduction What is Discrete Mathematics? Discrete Mathematics concerns processes that consist of a sequence.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Discrete Mathematics Lecture 1 Logic of Compound Statements
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Let remember from the previous lesson what is Knowledge representation
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
The Language of Propositional Logic The Syntax and Semantics of PL.
Copyright © Cengage Learning. All rights reserved.
Chapter 2: The Logic of Compound Statements 2.1 Logical Forms and Equivalence 12.1 Logical Forms and Equivalences Logic is a science of the necessary laws.
Adapted from Discrete Math
Chapter 2 – Fundamentals of Logic. Outline Basic Connectives and Truth Tables Logical Equivalence: The Laws of Logic Ligical Implication: Rules of Inference.
Discrete Mathematics and Its Applications
Discrete Mathematics CS 285. Lecture 12 Section 1.1: Logic Axiomatic concepts in math: Equals Opposite Truth and falsehood Statement Objects Collections.
Lecture for Week Spring.   Introduction to Propositional Logic  Types of Proposition  Operator and Truth table Agenda.
Chapter 1: The Foundations: Logic and Proofs
Chapter 2 Reasoning and Proof. AIM: Introduction to Logic What types of statements are considered mathematical ? Statements in which truth value (either.
CS 173, Lecture B September 1, 2015 Tandy Warnow.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Dr. Amer Rasheed COMSATS Institute of Information Technology
FALSE PREMISE.
Chapter 1 Section 1.2 Symbolic Logic. Sentences vs Statements A truth value is one of two words either true (T) or false (F). A statement is a particular.
2.2 Statements, Connectives, and Quantifiers
Discrete Mathematics MCA 105 LOGICS Preeti Mehta.
Copyright © Curt Hill Mathematical Logic An Introduction.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
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,
Thinking Mathematically
Discrete Mathematics CS 285. Lecture 12 Quick Overview The conceptual center of computer science is the ALGORITHM.
A logical puzzle Given situation: Three women stand behind each other. Each one carries a hat on her head and sees only the hats of the person(s) standing.
CS 1813 Discrete Mathematics, Univ Oklahoma Copyright © 2000 by Rex Page 1 Lecture 2 CS 1813 – Discrete Mathematics Proofs Propositions and Calculuses.
Chapter 1: The Foundations: Logic and Proofs
Thinking Mathematically Statements, Negations, and Quantified Statements.
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.
1 Propositional Logic: Fundamental Elements for Computer Scientists 0. Motivation for Computer Scientists 1. Propositions and Propositional Variables 2.
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
Section 1.1 Propositions and Logical Operations. Introduction Remember that discrete is –the study of decision making in non-continuous systems. That.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Discrete Mathematics Lecture # 1. Course Objectives  Express statements with the precision of formal logic.  Analyze arguments to test their validity.
Advanced Mathematics For CS “Discrete Mathematics” Prepared By: Dr. Eng. Moustafa Reda AbdALLAH 1434 – nd Term هجرية 1 Kingdom of Saudi Arabia Ministry.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Discrete Math by R.S. Chang, Dept. CSIE, NDHU1 Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
Chapter 1 Propositional Logic
DISCRETE MATHEMATICS CHAPTER I.
Lecture 1 – Formal Logic.
Chapter 3: Introduction to Logic
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
Ch.1 (Part 1): The Foundations: Logic and Proofs
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Logic – Bell Ringer.
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
CS 220: Discrete Structures and their Applications
Applied Discrete Mathematics Week 1: Logic
Back to “Serious” Topics…
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
The Logic of Declarative Statements
Statements and Logical Connectives
Starting out with formal logic
Truth tables.
Presentation transcript:

Lecture 2 Discrete Mathematics 9/3/2015 1

Introduction What is Discrete Mathematics? Discrete Mathematics concerns processes that consist of a sequence of individual steps. LOGIC: Logic is the study of the principles and methods that distinguish between a valid and an invalid argument. SIMPLE STATEMENT: A statement is a declarative sentence that is either true or false but not both. A statement is also referred to as a proposition 9/3/2015 2

1 Logic Concepts The logic imitate our intuitions feelings by setting down explaining ideas that behave analogously The logic furnishes statements that describe the surrounding world that can be true/false. Used in numerous applications: circuit design, programs, verification of correctness of programs, artificial intelligence, etc. 9/3/2015 3

Propositional Logic Is a declarative statement that is either true or false, but not both. It is not an Opinion, a Command, or a Question. Such as: – Washington, D.C., is the capital of USA – California is adjacent to New York – 1+1=2 – 2+2=5 Not declarative – What time is it? Question – Read this carefully Command It is a nice day opinion 9/3/2015 4

Propositional Logic Elementary/Simple statement is atomic, with a verb, subject and object but no connectives (NOT, OR, AND, If…Then, Iff) Construct correct mathematical arguments. Give precise meaning to mathematical statements Focuses on the relationships among statements. Rules are used to distinguish between valid (True) and invalid (False) arguments/statement. Hence logic assures us for any combination/connection of these statements as being True/False. 9/3/2015 5

Examples Propositions 1) Grass is green. 2) = 6 3) = 7 4) There are four fingers in a hand. Not Propositions 1) Close the door. 2) x is greater than 2. 3) He is very rich 9/3/2015 6

Examples Rule: If the sentence is preceded by other sentences that make the pronoun or variable reference clear, then the sentence is a statement. 9/3/2015 7

UNDERSTANDING STATEMENTS 1) x + 2 is positive. Not a statement 2) May I come in? Not a statement 3) Logic is interesting. A statement 4) It is hot today. A statement 5) -1 > 0 A statement 6) x + y = 12 Not a statement 9/3/2015 8

False, True, Statements Axiom : False is the opposite to Truth. A statement/declaration/declarative-statement is a description of something (sentence), which Is Not an Opinion, a Command, or Question. A statement Is A Sentence That Is Either True Or False, but not both simultaneously. 9/3/2015 9

Examples Examples of statements: – I’m 35 years old. – I have 100 children. – I always tell the truth. – I’m lying to you. Q’s: Which statements are: True? False? Both? Neither? 9/3/

EXAMPLES: a. 2+2 = 4, b. It is Sunday today If a proposition is true, we say that it has a truth value of "true”. If a proposition is false, its truth value is "false". The truth values “true” and “false” are, respectively, denoted by the letters T and F. 9/3/

Logical connectives 9/3/ EXAMPLES: 1. “3 + 2 = 5” and “Makka is a city in KSA” 2. “The grass is green” or “ It is hot today” 3. “Discrete Mathematics is not difficult to me”. AND, OR, NOT are called LOGICAL CONNECTIVES. SYMBOLIC REPRESENTATION Statements are symbolically represented by letters such as p, q, r,... EXAMPLES: p = “Riyadh is the capital of KSA” q = “17 is divisible by 3”

Symbolic logic 9/3/ In symbolic logic, we use lower case letters such as p, q, r, and s to represent statements. Here are two examples: p: Riyadh is the capital of KSA. q: Abin Al-Haythim is one of the greatest muslim scientists. Hence: The letter p represents the 1 st statement. The letter q represents the 2 nd statement.

Logical operators /connevtives 9/3/ If you're wealthy or well educated, then you'll be happy. We can break this statement down into three basic sentences: You're wealthy, You're well educated, You'll be happy. These sentences are called simple statements because each one conveys/takes/sends/carries/transfers/delivers one idea with no connecting words. Statements formed by combining two or more simple statements are called compound statements. Logical connectives are used to join simple statements to form a compound statement. These Connectives include the words AND, OR, IF... THEN, and IF AND ONLY IF.

Compound statements 9/3/ Compound statements appear throughout written and spoken language. We need to be able to understand the logic of such statements to analyze information objectively. we will concentrate our analysis on four kinds of compound statements.

TABLE 9/3/ CONNECTIVEMEANINGSYMBOLECALLED NegationNot ¬ Tilde ConjunctionAnd ∧ Hat DisjunctionOr ∨ Vel ConditionalIf …..then …. → Arrow BiconditionalIf and only if ↔ Double arrow

Exercise sets determine whether or not each sentence is a Statement. Specify which is True and which is False. 1. George W. Bush was the Democratic candidate for president in John Kerry was the Republican candidate for president in Take the most interesting classes you can find. 4. Don't try to study on a Friday night in the dorms. 5. The average human brain contains 100 billion neurons. 9/3/

Exercise 6. There are rivets in the Eiffel Tower. 7. Is the unexamined life worth living? 8. Is this the best of all possible worlds? 9. Some Catholic countries have legalized same-sex marriage. l0. Some U.S. presidents were assassinated = x 6 = 64 9/3/