# Logic and Proofs. Chapter 1

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Section Chapter 1 Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers 1.5 Rules of Inference 1.6 Introduction to Proofs 1.7 Proof Methods and Strategy

2 Section 1.1 Propositional Logic PROPOSITIONAL LOGIC PROPOSITIONS

3 1.1.2 Chapter 1 Logic and Proofs

4 Section 1.1 Propositional Logic TRUTH TABLES

5 1.1.4 Chapter 1 Logic and Proofs

6 Section 1.1 Propositional Logic 1.1.5

7 1.1.6 Chapter 1 Logic and Proofs

8 Section 1.1 Propositional Logic CONDITIONAL OPERATOR

9 1.1.8 Chapter 1 Logic and Proofs

10 Section 1.1 Propositional Logic COMPOUND PROPOSITIONAL FORMS

11 Chapter 1 Logic and Proofs

12 Section 1.1 Propositional Logic

13 Section 1.2 Logical Equivalences LOGICAL EQUIVALENCES

14 1.2.2 Chapter 1 Logic and Proofs CONTRAPOSITIVE, etc.

15 Section 1.2 Logical Equivalences 1.2.3

16 1.2.4 Chapter 1 Logic and Proofs CATEGORIES of PROPOSITIONAL FORMS

17 Section 1.2 Logical Equivalences LAWS of LOGIC AVOIDING BOREDOM

18 Section 1.3 Predicates & Quantifiers PREDICATES & QUANTIFIERS

19 1.3.2 Chapter 1 Logic and Proofs VARYING THE DOMAIN

20 Section 1.3 Predicates & Quantifiers CLASSROOM EXERCISE

21 1.3.4 Chapter 1 Logic and Proofs SCOPE of QUANTIFIERS

22 Section 1.3 Predicates & Quantifiers NEGATION with QUANTIFIERS CLASSROOM EXERCISE

23 Section 1.4 Nested Quantifiers NESTED QUANTIFIERS TRANSPOSING QUANTIFIERS

24 1.4.2 Chapter 1 Logic and Proofs RECALL NEGATION with QUANTIFIERS CLASSROOM EXERCISE

25 Section 1.4 Nested Quantifiers OPTIONAL CLASSROOM EXERCISE

26 Section 1.5 Rules of Inference RULES OF INFERENCE

27 1.5.2 Chapter 1 Logic and Proofs VALID ARGUMENTS

28 Section 1.5 Rules of Inference 1.5.3

29 1.5.4 Chapter 1 Logic and Proofs FALLACIES

30 Section 1.5 Rules of Inference NOTORIOUS FALLACIES

31 1.5.6 Chapter 1 Logic and Proofs VALIDITY and TRUTH LOGICAL RULES of INFERENCE

32 Section 1.5 Rules of Inference 1.5.7

33 1.5.8 Chapter 1 Logic and Proofs MATHEMATICAL PROOFS (DIRECT)

34 Section 1.5 Rules of Inference MATHEMATICAL PROOFS (INDIRECT)

35 Chapter 1 Logic and Proofs TERMINOLOGY

36 Section 1.6 Introduction to Proofs INTRODUCTION TO PROOFS TWO FAMOUS PROBLEMS

37 Section 1.7 Proof Strategy PROOF STRATEGY FORWARD AND BACKWARD REASONING

38 1.7.2 Chapter 1 Logic and Proofs MATHEMATICAL PROOFS (by CASES)

39 Section 1.7 Proof Strategy PROVING QUANTIFIED ASSERTIONS

40 Section 1.9 Logic Supplement LOGIC SUPPLEMENT PROPOSITIONS

41 1.9.2 Chapter 1 Logic and Proofs TIME OUT to discuss OBSCENITY

42 Section 1.9 Logic Supplement 1.9.3

### def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

### Inference Rules and Proof Methods

Inference Rules and Proof Methods Winter 2010 Introduction Rules of Inference and Formal Proofs Proofs in mathematics are valid arguments that establish the truth of mathematical statements. An argument

### Chapter I Logic and Proofs

MATH 1130 1 Discrete Structures Chapter I Logic and Proofs Propositions A proposition is a statement that is either true (T) or false (F), but or both. s Propositions: 1. I am a man.. I am taller than

### 1 Proposition, Logical connectives and compound statements

Discrete Mathematics: Lecture 4 Introduction to Logic Instructor: Arijit Bishnu Date: July 27, 2009 1 Proposition, Logical connectives and compound statements Logic is the discipline that deals with the

### CS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers

CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)

### 2. Propositional Equivalences

2. PROPOSITIONAL EQUIVALENCES 33 2. Propositional Equivalences 2.1. Tautology/Contradiction/Contingency. Definition 2.1.1. A tautology is a proposition that is always true. Example 2.1.1. p p Definition

### Midterm Examination 1 with Solutions - Math 574, Frank Thorne Thursday, February 9, 2012

Midterm Examination 1 with Solutions - Math 574, Frank Thorne (thorne@math.sc.edu) Thursday, February 9, 2012 1. (3 points each) For each sentence below, say whether it is logically equivalent to the sentence

### The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

### CHAPTER 1. Logic, Proofs Propositions

CHAPTER 1 Logic, Proofs 1.1. Propositions A proposition is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: Paris is in France (true), London

### WUCT121. Discrete Mathematics. Logic

WUCT121 Discrete Mathematics Logic 1. Logic 2. Predicate Logic 3. Proofs 4. Set Theory 5. Relations and Functions WUCT121 Logic 1 Section 1. Logic 1.1. Introduction. In developing a mathematical theory,

### MATH 55: HOMEWORK #2 SOLUTIONS

MATH 55: HOMEWORK # SOLUTIONS ERIC PETERSON * 1. SECTION 1.5: NESTED QUANTIFIERS 1.1. Problem 1.5.8. Determine the truth value of each of these statements if the domain of each variable consists of all

### CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo

Propositional Logic CSE 191, Class Note 01 Propositional Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 37 Discrete Mathematics What is Discrete

### Section 1. Statements and Truth Tables. Definition 1.1: A mathematical statement is a declarative sentence that is true or false, but not both.

M3210 Supplemental Notes: Basic Logic Concepts In this course we will examine statements about mathematical concepts and relationships between these concepts (definitions, theorems). We will also consider

### n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional

### Propositional Logic and Methods of Inference SEEM

Propositional Logic and Methods of Inference SEEM 5750 1 Logic Knowledge can also be represented by the symbols of logic, which is the study of the rules of exact reasoning. Logic is also of primary importance

### The Predicate Calculus in AI

Last time, we: The Predicate Calculus in AI Motivated the use of Logic as a representational language for AI (Can derive new facts syntactically - simply by pushing symbols around) Described propositional

### Review Name Rule of Inference

CS311H: Discrete Mathematics Review Name Rule of Inference Modus ponens φ 2 φ 2 Modus tollens φ 2 φ 2 Inference Rules for Quantifiers Işıl Dillig Hypothetical syllogism Or introduction Or elimination And

### Predicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.

Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is

### DISCRETE MATHEMATICS W W L CHEN

DISCRETE MATHEMATICS W W L CHEN c W W L Chen, 1982, 2008. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It is available free

### CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

### Chapter 1, Part II: Predicate Logic. With Question/Answer Animations

Chapter 1, Part II: Predicate Logic With Question/Answer Animations Summary Predicate Logic (First-Order Logic (FOL) The Language of Quantifiers Logical Equivalences Nested Quantifiers Translation from

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

### L - Standard Letter Grade P - Pass/No Pass Repeatability: N - Course may not be repeated

Course: MATH 26 Division: 10 Also Listed As: 200930, INACTIVE COURSE Short Title: Full Title: DISCRETE MATHEMATIC Discrete Mathematics Contact Hours/Week Lecture: 4 Lab: 0 Other: 0 Total: 4 4 Number of

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 1, due Wedneday, January 25 1.1.10 Let p and q be the propositions The election is decided and The votes have been counted, respectively.

### Lecture 13 of 41. More Propositional and Predicate Logic

Lecture 13 of 41 More Propositional and Predicate Logic Monday, 20 September 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading: Sections 8.1-8.3, Russell and Norvig

### 1.5 Rules of Inference

1.5 Rules of Inference (Inference: decision/conclusion by evidence/reasoning) Introduction Proofs are valid arguments that establish the truth of statements. An argument is a sequence of statements that

### What is logic? Propositional Logic. Negation. Propositions. This is a contentious question! We will play it safe, and stick to:

Propositional Logic This lecture marks the start of a new section of the course. In the last few lectures, we have had to reason formally about concepts. This lecture introduces the mathematical language

### CS 441 Discrete Mathematics for CS Lecture 2. Propositional logic. CS 441 Discrete mathematics for CS. Course administration

CS 441 Discrete Mathematics for CS Lecture 2 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Course administration Homework 1 First homework assignment is out today will be posted

### 1.5 Methods of Proof INTRODUCTION

1.5 Methods of Proof INTRODUCTION Icon 0049 Two important questions that arise in the study of mathematics are: (1) When is a mathematical argument correct? (2) What methods can be used to construct mathematical

### DISCRETE MATH: LECTURE 3

DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false

### LOGICAL INFERENCE & PROOFs. Debdeep Mukhopadhyay Dept of CSE, IIT Madras

LOGICAL INFERENCE & PROOFs Debdeep Mukhopadhyay Dept of CSE, IIT Madras Defn A theorem is a mathematical assertion which can be shown to be true. A proof is an argument which establishes the truth of a

### Predicate Logic. Lucia Moura. Winter Predicates and Quantifiers Nested Quantifiers Using Predicate Calculus

Predicate Logic Winter 2010 Predicates A Predicate is a declarative sentence whose true/false value depends on one or more variables. The statement x is greater than 3 has two parts: the subject: x is

### 1.3 Induction and Other Proof Techniques

4CHAPTER 1. INTRODUCTORY MATERIAL: SETS, FUNCTIONS AND MATHEMATICAL INDU 1.3 Induction and Other Proof Techniques The purpose of this section is to study the proof technique known as mathematical induction.

### Discrete Mathematics, Chapter : Predicate Logic

Discrete Mathematics, Chapter 1.4-1.5: Predicate Logic Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.4-1.5 1 / 23 Outline 1 Predicates

### Logic will get you from A to B. Imagination will take you everywhere.

Chapter 3 Predicate Logic Logic will get you from A to B. Imagination will take you everywhere. A. Einstein In the previous chapter, we studied propositional logic. This chapter is dedicated to another

### 31 is a prime number is a mathematical statement (which happens to be true).

Chapter 1 Mathematical Logic In its most basic form, Mathematics is the practice of assigning truth to welldefined statements. In this course, we will develop the skills to use known true statements to

### Artificial Intelligence Automated Reasoning

Artificial Intelligence Automated Reasoning Andrea Torsello Automated Reasoning Very important area of AI research Reasoning usually means deductive reasoning New facts are deduced logically from old ones

### mywbut.com Propositional Logic inference rules

Propositional Logic inference rules 1 5.5 Rules of Inference Here are some examples of sound rules of inference. Each can be shown to be sound once and for all using a truth table. The left column contains

### Part A Course Outline

University of Macau Faculty of Science and Technology Department of Computer and Information Science Department of Electrical and Computer Engineering CISB111/ECEB222 Discrete Structures Syllabus 2 nd

### Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

### vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

### CSI 2101 Discrete Structures Winter 2012

CSI 2101 Discrete Structures Winter 2012 Prof. Lucia Moura University of Ottawa Homework Assignment #1 (100 points, weight 5%) Due: Thursday Feb 9, at 1:00 p.m. (in lecture); assignments with lateness

### Discrete Mathematics, Chapter : Propositional Logic

Discrete Mathematics, Chapter 1.1.-1.3: Propositional Logic Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 1.1-1.3 1 / 21 Outline 1 Propositions

### Exam 1 Answers: Logic and Proof

Q250 FALL 2012, INDIANA UNIVERSITY Exam 1 Answers: Logic and Proof September 17, 2012 Instructions: Please answer each question completely, and show all of your work. Partial credit will be awarded where

### DISCRETE MATH: LECTURE 4

DISCRETE MATH: LECTURE 4 DR. DANIEL FREEMAN 1. Chapter 3.1 Predicates and Quantified Statements I A predicate is a sentence that contains a finite number of variables and becomes a statement when specific

### Propositional Logic. Definition: A proposition or statement is a sentence which is either true or false.

Propositional Logic Definition: A proposition or statement is a sentence which is either true or false. Definition:If a proposition is true, then we say its truth value is true, and if a proposition is

### Discrete Mathematics for Computer Science

CS 441 Discrete Mathematics for CS Discrete Mathematics for Computer Science Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Course administrivia Instructor: Milos Hauskrecht 5329 Sennott Square

### 3. Logical Reasoning in Mathematics

3. Logical Reasoning in Mathematics Many state standards emphasize the importance of reasoning. We agree disciplined mathematical reasoning is crucial to understanding and to properly using mathematics.

### Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

Chapter 1, Part I: Propositional Logic With Question/Answer Animations Chapter Summary Propositional Logic The Language of Propositions Applications Logical Equivalences Predicate Logic The Language of

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### 3. Predicates and Quantifiers

3. PREDICATES AND QUANTIFIERS 45 3. Predicates and Quantifiers 3.1. Predicates and Quantifiers. Definition 3.1.1. A predicate or propositional function is a description of the property (or properties)

### Discrete Mathematics Lecture 1 Logic of Compound Statements. Harper Langston New York University

Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University Administration Class Web Site http://cs.nyu.edu/courses/summer05/g22.2340-001/ Mailing List Subscribe at

### 1. Use the following truth table to answer the questions.

Topic 3: Logic 3.3 Introduction to Symbolic Logic Negation and Conjunction Disjunction and Exclusive Disjunction 3.4 Implication and Equivalence Disjunction and Exclusive Disjunction Truth Tables 3.5 Inverse,

### CS 2336 Discrete Mathematics

CS 2336 Discrete Mathematics Lecture 2 Logic: Predicate Calculus 1 Outline Predicates Quantifiers Binding Applications Logical Equivalences 2 Predicates In mathematics arguments, we will often see sentences

### Discrete Mathematics

Slides for Part IA CST 2014/15 Discrete Mathematics Prof Marcelo Fiore Marcelo.Fiore@cl.cam.ac.uk What are we up to? Learn to read and write, and also work with, mathematical

### 1.5 Arguments & Rules of Inference

1.5 Arguments & Rules of Inference Tools for establishing the truth of statements Argument involving a seuence of propositions (premises followed by a conclusion) Premises 1. If you have a current password,

### CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.

CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:

### conditional statement conclusion Vocabulary Flash Cards Chapter 2 (p. 66) Chapter 2 (p. 69) Chapter 2 (p. 66) Chapter 2 (p. 76)

biconditional statement conclusion Chapter 2 (p. 69) conditional statement conjecture Chapter 2 (p. 76) contrapositive converse Chapter 2 (p. 67) Chapter 2 (p. 67) counterexample deductive reasoning Chapter

### Section 3 Sequences and Limits

Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

### 2.4 Mathematical Induction

2.4 Mathematical Induction What Is (Weak) Induction? The Principle of Mathematical Induction works like this: What Is (Weak) Induction? The Principle of Mathematical Induction works like this: We want

### 1.4/1.5 Predicates and Quantifiers

1.4/1.5 Predicates and Quantifiers Can we express the following statement in propositional logic? Every computer has a CPU No Outline: Predicates Quantifiers Domain of Predicate Translation: Natural Languauge

### Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from

### Even Number: An integer n is said to be even if it has the form n = 2k for some integer k. That is, n is even if and only if n divisible by 2.

MATH 337 Proofs Dr. Neal, WKU This entire course requires you to write proper mathematical proofs. All proofs should be written elegantly in a formal mathematical style. Complete sentences of explanation

### 3.3. INFERENCE 105. Table 3.5: Another look at implication. p q p q T T T T F F F T T F F T

3.3. INFERENCE 105 3.3 Inference Direct Inference (Modus Ponens) and Proofs We concluded our last section with a proof that the sum of two even numbers is even. That proof contained several crucial ingredients.

### 1 Propositional Logic - Axioms and Inference Rules

1 Propositional Logic - Axioms and Inference Rules Axioms Axiom 1.1 [Commutativity] (p q) (q p) (p q) (q p) (p q) (q p) Axiom 1.2 [Associativity] p (q r) (p q) r p (q r) (p q) r Axiom 1.3 [Distributivity]

### Sum of Rational and Irrational Is Irrational

About Illustrations: Illustrations of the Standards for Mathematical Practice (SMP) consist of several pieces, including a mathematics task, student dialogue, mathematical overview, teacher reflection

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.

irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto

### Predicate in English. Predicates and Quantifiers. Propositional Functions: Prelude. Predicate in Logic. Propositional Function

Predicates and Quantifiers By Chuck Cusack Predicate in English In English, a sentence has 2 parts: the subject and the predicate. The predicate is the part of the sentence that states something about

### Predicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering

Predicate logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Predicate logic Slide 1/24

### Math 3000 Running Glossary

Math 3000 Running Glossary Last Updated on: July 15, 2014 The definition of items marked with a must be known precisely. Chapter 1: 1. A set: A collection of objects called elements. 2. The empty set (

### Chapter 1 LOGIC AND PROOF

Chapter 1 LOGIC AND PROOF To be able to understand mathematics and mathematical arguments, it is necessary to have a solid understanding of logic and the way in which known facts can be combined to prove

### COMP 250 Fall Mathematical induction Sept. 26, (n 1) + n = n + (n 1)

COMP 50 Fall 016 9 - Mathematical induction Sept 6, 016 You will see many examples in this course and upcoming courses of algorithms for solving various problems It many cases, it will be obvious that

### Cosmological Arguments for the Existence of God S. Clarke

Cosmological Arguments for the Existence of God S. Clarke [Modified Fall 2009] 1. Large class of arguments. Sometimes they get very complex, as in Clarke s argument, but the basic idea is simple. Lets

### ML for the Working Programmer

ML for the Working Programmer 2nd edition Lawrence C. Paulson University of Cambridge CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface to the Second Edition Preface xiii xv 1 Standard ML 1 Functional Programming

### Logic, Sets, and Proofs

Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical

### Example. Statements in Predicate Logic. Predicate Logic. Predicate Logic. (Rosen, Chapter ) P(x,y) TOPICS. Predicate Logic

Predicate Logic Predicate Logic (Rosen, Chapter 1.4-1.6) TOPICS Predicate Logic Quantifiers Logical Equivalence Predicate Proofs n Some statements cannot be expressed in propositional logic, such as: n

### Introduction to Proofs

Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are

### FACULTY OF INFORMATION TECHNOLOGY

FACULTY OF INFORMATION TECHNOLOGY Course Specifications: (MATH 251) Month, Year: Fall 2008 University: Misr University for Science and Technology Faculty : Faculty of Information Technology Course Specifications

### Boolean or Propositional Logic

Boolean or Propositional Logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Boolean

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 1 Course Outline CS70 is a course on Discrete Mathematics and Probability for EECS Students. The purpose of the course

### CSI 2101 / Rules of Inference ( 1.5)

CSI 2101 / Rules of Inference ( 1.5) Introduction what is a proof? Valid arguments in Propositional Logic equivalence of quantified expressions Rules of Inference in Propositional Logic the rules using

### Logic Appendix. Section 1 Truth Tables CONJUNCTION EXAMPLE 1

Logic Appendix T F F T Section 1 Truth Tables Recall that a statement is a group of words or symbols that can be classified collectively as true or false. The claim 5 7 12 is a true statement, whereas

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the

### Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li Kishan Mehrotra 3 L A TEX at July 18, 007 1 No part of this book can be reproduced without permission from the authors Illinois State University, Normal,

### A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

### Florida State University Course Notes MAD 2104 Discrete Mathematics I

Florida State University Course Notes MAD 2104 Discrete Mathematics I Florida State University Tallahassee, Florida 32306-4510 Copyright c 2011 Florida State University Written by Dr. John Bryant and Dr.

### 4 Domain Relational Calculus

4 Domain Relational Calculus We now present two relational calculi that we will compare to RA. First, what is the difference between an algebra and a calculus? The usual story is that the algebra RA is

### Introduction to Symbolic Logic Vaishali Khandekar, PhD Course Description: PREREQUISITE(S): CO-REQUISITE(S): FREQUENT REQUISITES

Introduction to Symbolic Logic PHIL 2303-77400 Fall 2013 (3 Credit Hours) HCC Northwest College Tuesday, Thursday 11:00 AM 12:30 PM Instructor: Vaishali Khandekar, PhD Katy Campus, Room 347 Vaishali.khandekar@hccs.edu

### Computing Science 272 Solutions to Midterm Examination I Tuesday February 8, 2005

Computing Science 272 Solutions to Midterm Examination I Tuesday February 8, 2005 Department of Computing Science University of Alberta Question 1. 8 = 2+2+2+2 pts (a) How many 16-bit strings contain exactly

### 1.4 Predicates and Quantifiers

Can we express the following statement in propositional logic? Every computer has a CPU No 1 Can we express the following statement in propositional logic? No Every computer has a CPU Let's see the new

### Predicates and Quantifiers. Niloufar Shafiei

Predicates and Quantifiers Niloufar Shafiei Review Proposition: 1. It is a sentence that declares a fact. 2. It is either true or false, but not both. Examples: 2 + 1 = 3. True Proposition Toronto is the

### Geometry - Chapter 2 Review

Name: Class: Date: Geometry - Chapter 2 Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Determine if the conjecture is valid by the Law of Syllogism.

### Invalidity in Predicate Logic

Invalidity in Predicate Logic So far we ve got a method for establishing that a predicate logic argument is valid: do a derivation. But we ve got no method for establishing invalidity. In propositional

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### Definition 10. A proposition is a statement either true or false, but not both.

Chapter 2 Propositional Logic Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. (Lewis Carroll, Alice s Adventures