Discrete Mathematics Lecture 1: Introduction

Slides:



Advertisements
Similar presentations
12.2: And and Or in Logic 1/17/ : And, Or and Not in Logic Expectations: L3.2.1:Know and use the terms of basic logic (e.g., proposition, negation,
Advertisements

Introduction to Logic Sections 1.1, 1.2, 1.3 of Rosen Spring 2012 CSCE 235 Introduction to Discrete Structures URL: cse.unl.edu/~choueiry/S All questions:
Discrete Mathematics Lecture 1 Logic of Compound Statements
KNURE, Software department, Ph , N.V. Bilous Faculty of computer sciences Software department, KNURE Boolean Algebra.
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
CSE 311 Foundations of Computing I Spring 2013 Lecture 1 Propositional Logic.
CS128 – Discrete Mathematics for Computer Science
CSE 311 Foundations of Computing I Autumn 2011 Lecture 1 Propositional Logic.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Discrete Mathematics Math 6A Instructor: M. Welling.
Adapted from Discrete Math
3.2 – Truth Tables and Equivalent Statements
CSCI2110 – Discrete Mathematics Tutorial 8 Propositional Logic Wong Chung Hoi (Hollis)
Propositions and Truth Tables
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
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.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Ch.1 (Part 1): The Foundations: Logic and Proofs Introduction.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Fall 2002CMSC Discrete Structures1 Let’s get started with... Logic !
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
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.
Thinking Mathematically
Discrete Mathematics ( 離散數學 ) Ming-Jer Tsai. Outline What is Discrete Mathematics? Why learn Discrete Mathematics? What will be taught in the class? How.
CS 139 – Programming Fundamentals Lecture 08A. Relational/comparison Operators Relational Operator Meaning > is greater than < is less than >= is greater.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
CS104 The Foundations: Logic and Proof 1. 2 What is Discrete Structure?  Discrete Objects  Separated from each other (Opposite of continuous)  e.g.,
Discrete Structures MT217 Lecture 01. Course Objectives Express statements with the precision of formal logic Analyze arguments to test their validity.
INTRODUCTION TO LOGIC. PURPOSE: – To distinguish good arguments from poor ones Arguments consist of STATEMENTS – A statement is a sentence that can be.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Chapter 1 – Part 3 ELEMENTARY LOGIC
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
AND.
Thinking Mathematically
Truth Tables and Equivalent Statements
Truth Tables for Negation, Conjunction, and Disjunction
Logic.
Biconditional - 2 CS-708.
CPCS222 Discrete Structures I
Ch.1 (Part 1): The Foundations: Logic and Proofs
Discrete Mathematics Lecture # 2.
CMSC Discrete Structures
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
(1.4) An Introduction to Logic
1 Chapter An Introduction to Problem Solving
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 6: Set and Function
Discrete Mathematics Lecture 2: Propositional Logic
Discrete Mathematics Logic.
1 Chapter An Introduction to Problem Solving
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
CSE 321 Discrete Structures
MAT 3100 Introduction to Proof
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics Lecture 1: Introduction
Logic and Reasoning.
2-2 Logic Vocab Statement: A sentence that is either true or false
Presentation transcript:

Discrete Mathematics Lecture 1: Introduction By: Nur Uddin, Ph.D

What is discrete? Discrete : distinct or not connected

Discrete vs Continuous Discussion

Natural numbers vs real numbers Natural numbers are discrete while real numbers are continuous.

What is discrete mathematics? Discrete mathematics is the study of discrete objects.

Why we need to study discrete mathematics? Computer works in a discrete system (digital) Discrete mathematics is the basic in computer studies and applications, e.g.: Software development Computer security (cryptography) Automata etc

Syllabus

Warming up

Logic

Proportional Logic

Proportional Logic

Composite Statements

Composite Statements

Negation

Negation

Negation

Conjunction

Disjunction

Truth Table

Exclusive OR

Implication

Implication

Biconditional

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.