1 Discrete Structures CS 23022 Johnnie Baker Comments on Early Term Test.

Slides:



Advertisements
Similar presentations
With examples from Number Theory
Advertisements

Discrete Math Methods of proof 1.
Introduction to Proofs
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
TR1413: Discrete Mathematics For Computer Science Lecture 3: Formal approach to propositional logic.
CSE115/ENGR160 Discrete Mathematics 01/31/12 Ming-Hsuan Yang UC Merced 1.
CSE115/ENGR160 Discrete Mathematics 02/01/11
CMSC 250 Discrete Structures Exam #1 Review. 21 June 2007Exam #1 Review2 Symbols & Definitions for Compound Statements pq p  qp  qp  qp  qp  q 11.
So far we have learned about:
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
Adapted from Discrete Math
Methods of Proof & Proof Strategies
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Valid Arguments Decide if each argument is valid. If the stones are rolling, they are not gathering moss. If the stones are not gathering moss, they are.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Chapter 1 The Foundations: Logic and Proofs 歐亞書局.
Introduction to Proofs
CS 103 Discrete Structures Lecture 07b
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
1 Math/CSE 1019C: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta Office: CSEB 3043 Phone: ext
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.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
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.
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
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.
Module #1 - Logic Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen 1 Module.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.4, Slide 1 3 Logic The Study of What’s True or False or Somewhere in Between 3.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
2.3 Methods of Proof.
CS104:Discrete Structures Chapter 2: Proof Techniques.
1 Introduction to Abstract Mathematics Proof Methods , , ~, ,  Instructor: Hayk Melikya Purpose of Section:Most theorems in mathematics.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
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.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Uniqueness Quantifier ROI for Quantified Statement.
Chapter 1 Logic and proofs
Chapter 1 Logic and Proof.
2. The Logic of Compound Statements Summary
3. The Logic of Quantified Statements Summary
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
COMP 1380 Discrete Structures I Thompson Rivers University
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Proof Techniques.
Methods of Proof A mathematical theorem is usually of the form pq
Chapter 8 Logic Topics
The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.
CS 220: Discrete Structures and their Applications
A Brief Summary for Exam 1
Conditional Statements
Discrete Mathematics Logic.
MAT 3100 Introduction to Proof
Discrete Mathematics Lecture 4 Logic of Quantified Statements
COMP 1380 Discrete Structures I Thompson Rivers University
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Logic and Reasoning.
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

1 Discrete Structures CS Johnnie Baker Comments on Early Term Test

Comments on Early Term Exam Know truth tables for the basic constructs: and, or, implies, equivalence, exclusive or, biconditional, etc. Be able to calculate the truth table for compound statements. Understand standard terminology: contrapositive, converse, tautology, contridiction, Know the various logical equivalences: See Table 6-8 in section 1.2 Know meaning and equivalences involving  and  (universal quanifiers.) and how to negate these quantifiers. Be able to translate logic statements into English statements without variables and symbols. Conversely, be able to translate English statements into logic statements. Be able to verify correctness of reasoning involving logic statements. Also, be able to deduce conclusions from logic statements 2

Be able to negate nested quantifiers. Understand terminology like argument, valid, premises, fallacies, etc. Know and be able to use the various rules of inferences, such as those in Table 1 on pg 66. Be able to use the rules of inference to make logical arguments, as in Section 1.5. Look over added, suggested study odd-nr problems for Section 1.5, as no assignment was made for this section: 3,9,13,15,19,23,27,29,31. Understand how to work with universal and exitential generalizations and instantiations. Be able to verify validity of arguments and make arguments involving these concepts. In section 1.6, understand the terminology concerning mathematical proofs such as theorems, axioms/postulates, proof, etc. 3

In Section 1.6, understand the various methods of proving theorems. Be able to use the various methods for proving theorems to establish correctness of mathematical statements. Also, be able to identify errors in the proof of mathematical or logic arguments. Be able to establish show a mathematical statement is false using a counterexample. Understand mathematical terminology introduced in material covered, such as integer, rational, irrational, odd, even, Know the difference between constructive and non-constructive proofs. 4

Sets Understand set terminology such as set builder notation, and be able to use it. Know meaning of standard sets like N, Z, Q, R, Understand standard set theory terminology, e.g., element, subset, cartesian product, universal set, set difference, etc. Know standard set operations and be able to use them. Know the standard set identities such as Table 1 on pg 124. Be able to prove set identities such as (A  B)’ = A’  B’, and give reasons for all steps. Be able to use a truth table to establish set identities. 5