CSE 311: Foundations of Computing Fall 2013 Lecture 1: Propositional logic.

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Logic The study of correct reasoning.
Af2 Introduction. What’s the course about? Discrete Mathematics The mathematics that underpins computer science and other sciences as well.
Grading Lecture attendance: -1% per 2 unexcused absences
Based on Rosen, Discrete Mathematics & Its Applications, 5e (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module #0 - Overview.
CSE 311 Foundations of Computing I Spring 2013 Lecture 1 Propositional Logic.
January 5, 2015CS21 Lecture 11 CS21 Decidability and Tractability Lecture 1 January 5, 2015.
CS 581: Introduction to the Theory of Computation Lecture 1 James Hook Portland State University
1 CS233601: Discrete Mathematics Department of Computer Science National Tsing Hua University.
CSE 311 Foundations of Computing I Autumn 2011 Lecture 1 Propositional Logic.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
CSE 321 Discrete Structures Winter 2008 Lecture 1 Propositional Logic.
CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.
Conditional Statements
CSE 220 (Data Structures and Analysis of Algorithms) Instructor: Saswati Sarkar T.A. Dimosthenes Anthomelidis
CSE 311 Foundations of Computing I Autumn 2011 Lecture 2 More Propositional Logic Application: Circuits Propositional Equivalence.
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
CSNB143 – Discrete Structure
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Discrete Maths 2. Propositional Logic Objective
CSE 311 Foundations of Computing I Autumn 2012 Lecture 1 Propositional Logic 1.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Ch.1 (Part 1): The Foundations: Logic and Proofs Introduction.
CS 285- Discrete Mathematics Lecture 2. Section 1.1 Propositional Logic Propositions Conditional Statements Truth Tables of Compound Propositions Translating.
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Fall 2010 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
Foundations of Computing I CSE 311 Fall CSE 311: Foundations of Computing I Fall 2014 Lecture 1: Propositional Logic.
CSci 2011 Textbook ^Discrete Mathematics and Its Applications,  Rosen  6th Edition  McGraw Hill  2006.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Slides for CISC 2315: Discrete Structures Chapters CISC 2315 Discrete Structures Professor William G. Tanner, Jr. SPRING 2010 Slides created by James.
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
CISC 2315 Discrete Structures Professor William G. Tanner, Jr. Spring 2011 Slides created by James L. Hein, author of Discrete Structures, Logic, and Computability,
Discrete Structures – CS Text Discrete Mathematics and Its Applications Kenneth H. Rosen (7 th Edition) Chapter 1 The Foundations: Logic and Proofs.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
SSK3003 DISCRETE STRUCTURES
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
1/10/ Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone:
Discrete Mathematics CS 285. Lecture 12 Quick Overview The conceptual center of computer science is the ALGORITHM.
Chapter 1: The Foundations: Logic and Proofs
UMBC CMSC 203, Section Fall CMSC 203, Section 0401 Discrete Structures Fall 2004 Matt Gaston
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Discrete Structures Class Meeting 1. Outline of Today Information sheet Questionnaire Quiz 0 Learning mathematics – Reading math – Solving problems.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
1.  This course covers the mathematical foundations of computer science and engineering. It provides an introduction to elementary concepts in mathematics.
CPSC 121: Models of Computation REVIEW. Course Learning Outcomes You should be able to: – model important problems so that they are easier to discuss,
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
Discrete Structures MT217 Lecture 01. Course Objectives Express statements with the precision of formal logic Analyze arguments to test their validity.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Logic The study of correct reasoning.
COMP 283 Discrete Structures
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
Logic.
MATH 245 Spring 2009 This is mathematics for computer science
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
Ch.1 (Part 1): The Foundations: Logic and Proofs
Principles of Computing – UFCFA Lecture-1
CSCI 3310 Mathematical Foundation of Computer Science
Administrivia Course Web:
Information Technology Department
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
CS 281: Discrete Mathematics for Computer Science
CSE 321 Discrete Structures
CSE 321 Discrete Structures
Principles of Computing – UFCFA Week 1
Discrete Structures Prepositional Logic 2
Conditional Statements Section 2.3 GEOMETRY
Presentation transcript:

CSE 311: Foundations of Computing Fall 2013 Lecture 1: Propositional logic

about the course We will study… -Logic -Formal proofs -Set theory and functions -Basic number theory -Induction -CS structures: regular expressions, grammars, graphs, finite state machines -A little computability theory To form a solid foundation for further study of CSE

about the course Why? -Basis for thinking correctly and abstractly -Communicating precisely (formal specifications) -Correctness of programs -Representing knowledge - Algorithm design -Reasoning about huge inputs / big data -Understanding what problems are hard to solve

administration Instructors: Paul Beame and James Lee Teaching assistants: Emily Behrendt Armando Diaz Tolentino Hanchuan Li Vincent Liew Jianghong Shi King Xia Quiz sections: Thursdays Not tomorrow Book: Rosen Discrete Mathematics 6 th or 7 th edition Homework: Due WED at start of class Write up individually Exams: Midterm: November 4th Final: December 9 th 2:30-4:20 or 4:30-6:20 Non-standard time Grading: 50% homework 35% final exam 15% midterm All course information at

propositions

compound propositions

truth tables p  p p pq p  q pq p  q pq p  q

understanding complex propositions Either Henry gets on base and Reggie hits a home run, or Fernando wins the game. Atomic propositions h: Henry gets on base r: Reggie hits a home run f: Fernando wins the game (h  r)  f

complex propositions with a truth table f

aside: how many…? How many different binary operators are there on atomic propositions? p q

Implication: – p implies q – whenever p is true q must be true – if p then q – q if p – p is sufficient for q – p only if q p q p  q *If pigs could whistle then horses could fly.

converse, contrapositive, inverse Implication:p  q Converse:q  p Contrapositive:  q   p Inverse:  p   q Are these the same? Example p: “x is divisible by 2” q: “x is divisible by 4”

p iff q p is equivalent to q p implies q and q implies p pq p  q

English and logic You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old. q: you can ride the roller coaster r: you are under 4 feet tall s: you are older than 16 ( r   s)   q q  (  r  s ) s  ( r  q )