INTRODUCTION TO LOGIC
|
|
- Rosaline Elliott
- 5 years ago
- Views:
Transcription
1 INTRODUCTION TO LOGIC L. MARIZZA A. BAILEY 1. The beginning of Modern Mathematics Before Euclid, there were many mathematicians that made great progress in the knowledge of numbers, algebra and geometry. However, their work was so scattered and disorganized that much of the work was redundant. A volume of known mathematical concepts was necessary to keep mathematics from stagnating. Euclid was the first known mathematician to try to classify mathematical knowledge into the tiers of axioms, definitions, and theorems. An axiom, or postulate, is a statement which we assume in order to build our model of reality. For example, in planar geometry, we assume that between any two points, we can draw only one line between them. This is something that you have taken for granted since you learned what a point and line was. However, when does a line actually exist? Can you draw a line on your piece of paper? Did you answer yes? Actually, since your paper is not infinite, you could, at most, draw a line segment. Well, then, all we need is an infinite plane. What about on the ground? Can you draw an infinite line on the ground? If we were to draw a infinitely long straight line on the ground, we would come right back where we started. Obviously, this is because we live on a sphere. You may say, That isn t a line. Well, let s define line. If we wanted to define a line segment as the shortest path between the two endpoints, and a line to be it s infinite extension, then lines on a sphere are great circles. However, in spherical geometry, there is no unique line between two points. Consider, for example, the north and south pole. There are infinitely many great circles between the two poles. Below are some examples of axioms, which, given the difference, imply a completely different geometrical universe. Euclidean Geometry: Axiom 5: Given a line and a non-collinear point, there exists exactly one line Date: June 21,
2 2 parallel to the given line through that point. Spherical Geometry: Axiom 5: Given a line and a non-collinear point, there exist no lines parallel to the given line through that point. Hyperbolic Geometry: Axiom 5: Given a line and a non-collinear point, there exist infinitely lines parallel to the given line through that point. These axioms are necessary to build the geometry of each space, and each axiom yields a completely different geometry. Take a minute to illustrate the postulates above to convince yourself that these axioms are a natural consequence of the geometry they specify. Although, these axioms may make sense after a moments thought and some illustrations, they are meaningless if we haven t defined everything clearly. In Euclidean geometry, we imagine a line to be a straight curve which extends indefinitely in two directions but has no width. However, as soon as non-euclidean spaces were required to model physical reality, the definition of line required generalization. The beauty and art of mathematics is that we can define anything into existence in the mathematical world as long as it is well-defined. The ability to create new definitions allows mathematics to keep growing in order to satisfy some new model constructed to appease physicists, chemists, biologists, programmers, engineers, or just the whim of a mathematician. 2. Why Logic is Necessary To create definitions, axioms or prove theorems based on these definitions and axioms, it is necessary to first learn the art of using precise language and developing infallible arguments. Most people think of logic as the analysis of methods and reasoning, but there is more to logic than this. Logic is not interested in the content of an argument, but rather the form of the argument. Mathematics is about precision of argument. Therefore, the natural aim in studying logic is to make the form of argument precise. All men are mortal. Socrates is a man. Hence, Socrates is mortal. The validity of each premise or conclusion is not important. The logical question to answer is whether or not the premise implies the conclusion. However, the form of the argument above is not precise enough to easily identify the premise or conclusion. In order to better understand why precision in form and language is important, we will visit a well known historic paradox that baffled mathematicians at the time and revolutionized mathematics
3 Russel s Paradox. Not all of the fields of mathematics followed Euclid s example and continued to axiomatize their concepts. For example, in set theory, rather than develop an axiomatized approach to sets, the definition was loosely given as a collection of objects with a well-defined property. This model of set theory is called Naive Set Theory. Unfortunately, it led to a famous paradox found by Russel in Are you ready? This is going to be mind bender, so get your math pants on. Problem 1. Let A be the collection of all sets that are not members of themselves. Is A A? In other words, is A in this collection, or not? Solution 1. Let us first suppose A is in this collection. Then by its inherent property, it is a not a member of itself. Thus, it cannot be in this collection. WHAT???? Okay, don t give up. We can still suppose that A is not in this collection. But then it cannot satisfy the property that it is not a member of itself. Therefore it must be a member of itself... which means it is in this collection. Aaaaah! Both assumptions contradict themselves, and there is no other possibility. This can only mean one thing... there is something wrong with the entire model!. And that, my dears, is how axiomatic set theory was born. If you didn t like that, here is a simple analogy I was given by a student. Let C be a club that consists of all students who are not in any clubs. (**) If student A is not in any club, then student A is in club C. However, since student A is now in club C, student A is in a club, and can no longer be in club C. Therefore, student A is not in any club. and we go back to (**) Here is some more food for thought. Consider the following sentence, This sentence is false. What is the validity of this statement? Can we judge the validity, or is this statement a semantic paradox. The analysis of these, and other, paradoxes, has led to various suggestions for avoiding them. 3. Logical Connectives Sentences in logic are constructed by using various unary and binary operators. They are defined by truth tables. In fact, logical sentences are considered equivalent if their truth tables are the same. A logical sentence which is always true is called a tautology. In logic, statements are assigned variables, such as P and Q. A statement may be true, denoted, T, or false, F.
4 4 4. NOT The simplest of the operators is called negation. Definition 1 (negation). The truth function of the statement is negated. P P Negation yields opposite truth value. 5. AND The most natural and commonly used binary operator is the conjunction, or P and Q operator, is denoted P Q. We use the word and in sentences all the time, and it s important that we understand what they mean. Suppose there was a math club at school that only accepted members which are in upper school and in (Calculus or higher). Four students applied to join the club; Student A: 7th grader in Calculus BC Student B: 8th grader in Pre-Calculus Student C: 6th grader in Algebra 2 Student D: 9th grader in Calculus AB Which of the students above would be admitted into the math club? If you answered D, then you are correct! Move on to the next round. The students above had to satisfy both statements: P: Student is in eighth grade or higher Q: Student is in Calculus or higher
5 5 Definition 2 (and). The conjunction of two statements is given by the the following truth table and is denoted, P Q. P Q P Q T F F F The AND operator is only true when both statements are true. Label the students above with the case they represent in the logic table. 6. OR Another simple and commonly used binary operator is called or, which includes both statements being true, unlike its brother xor, or exclusive or, which is valid when exactly one statement is true. Let s revisit the math club at school. This time, they change the conditions for entry to include those members which are in upper school or have passed pre-calculus. This time when the four students apply to join the club, more of them are able to join; Student A: 7th grader in Calculus BC Student B: 8th grader in Pre-Calculus Student C: 6th grader in Algebra 2 Student D: 9th grader in Calculus AB Which of the students above would be admitted into the math club now that the conditions have changed? If you answered A,B and D, then you are correct! Move on to the next round. The students above had to satisfy at least one of the statements: P: Student is in eighth grade or higher Q: Student is in Calculus or higher Definition 3 (or). P Q is the notation for P or Q and is defined by the truth table below. P Q P Q T T T F The OR operator is only false when both statements are false. Using these three operators, we can construct a various assortment of logical sentences. Below is an example followed by a few exercises.
6 6 7. Exercises Example 1. Notice that first two columns represent the independent variables P and Q, which can take on values true or false. Columns are added as the logical statement becomes progressively more complicated. The logical sentence below can be thought of as a the functions, negations and or. P Q Q P Q T T F T Notice that the end truth value has changed and is almost the opposite of the truth table for and, which leads us to the first exercise. Exercise 1. Show that the logical sentence P Q is logically equivalent to (P Q). This tautology is called DeMorgan s Law. P Q P Q P Q P Q (P Q) Exercise 2. Show that the logical sentence P Q is logically equivalent to (P Q). This tautology is called DeMorgan s Law. P Q P Q P Q P Q (P Q)
7 7 8. Implications Conditional Statements are also commonly used and extraordinarily important in the construction of logical arguments. They consist of a premise and a conclusion. Unfortunately, conditional statements are usually given in ambiguous language where the premise and conclusion are difficult to identify Writing Conditional Statements. Below are some examples of conditional statements. Identify the premise of each statement and write it under the column labeled P. Write the conclusion of each statement under the column labeled Q. Do not worry about the validity of each statement, that will be analyzed next. Statement P Q Only women have babies. Joe needs, at least, a C on the test to pass the class. All Joe needs is a B on the test to pass the class. All babies wear diapers. All of the conditional statements above would be more easily understood if they were of the form, or P = Q If P, then Q 9. Validity of Implications It is easy to be confused about the truth value of a conditional statement. Most people are under the impression that if the premise is false, then the implication is false. This, however, cannot be further from the truth. Consider the following statement: If a number is odd, then it is prime. Now consider the number 3. Does it satisfy the hypothesis? Is it prime? Does the existence of the number 3 show the statement to be false? Now consider the number 2. Does it satisfy the hypothesis? Is it prime? Does the existence of the number 2 show the statement to be false? Now consider the number 4. Does it satisfy the hypothesis? Is it prime? Does the existence of the number 4 show the statement to be false? Suppose I gave you the number 9. Does it satisfy the hypothesis? Is it prime?
8 8 Does the existence of the number 9 show the statement to be false? This last number is a counterexample to the statement and therefore shows that the statement is not true for all numbers, and,hence, is not a true statement. Thus it is an example which shows the premise to be true and the conclusion to be false which yields a the implication false. Below is the truth table for the binary operator, implication: P Q P = Q T F T F The IMPLICATION operator is only false when the premise is true and conclusion false. 10. Exercises Exercise 3. Compute the truth table for the converse of a conditional statement, Q = P P Q Q = P Exercise 4. Compute the truth table for the contrapositive of a conditional statement, Q = P P Q Q P Q = P
9 9 Exercise 5. Compute the truth table for the inverse of a conditional statement, P = Q P Q P Q P = Q Exercise 6. Which of the statements has a truth table equivalent to the original statement? Converse, Inverse, or Contrapositive? Exercise 7. The binary logical operator if and only if, or logical equivalence, denoted P Q means (P = Q) (Q = P ). Compute the truth table below. P Q P = Q Q = P (P = Q) (Q = P ) Exercise 8. Compute the following truth table and summarize the results. P Q P = Q P Q (P = Q) ( P Q) Basis Scottsdale address: mbailey@basisscottsdale.org
Introduction to Logic
Introduction to Logic L. Marizza A. Bailey June 21, 2014 The beginning of Modern Mathematics Before Euclid, there were many mathematicians that made great progress in the knowledge of numbers, algebra
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationSection 3.1: Direct Proof and Counterexample 1
Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion
More informationChapter 4. Basic Set Theory. 4.1 The Language of Set Theory
Chapter 4 Basic Set Theory There are two good reasons for studying set theory. First, it s a indispensable tool for both logic and mathematics, and even for other fields including computer science, linguistics,
More informationCM10196 Topic 2: Sets, Predicates, Boolean algebras
CM10196 Topic 2: Sets, Predicates, oolean algebras Guy McCusker 1W2.1 Sets Most of the things mathematicians talk about are built out of sets. The idea of a set is a simple one: a set is just a collection
More informationMath Real Analysis
1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch
More informationCHAPTER 1. Introduction
CHAPTER 1 Introduction A typical Modern Geometry course will focus on some variation of a set of axioms for Euclidean geometry due to Hilbert. At the end of such a course, non-euclidean geometries (always
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More information35 Chapter CHAPTER 4: Mathematical Proof
35 Chapter 4 35 CHAPTER 4: Mathematical Proof Faith is different from proof; the one is human, the other is a gift of God. Justus ex fide vivit. It is this faith that God Himself puts into the heart. 21
More informationDefinition 2. Conjunction of p and q
Proposition Propositional Logic CPSC 2070 Discrete Structures Rosen (6 th Ed.) 1.1, 1.2 A proposition is a statement that is either true or false, but not both. Clemson will defeat Georgia in football
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
More information2-1. Inductive Reasoning and Conjecture. Lesson 2-1. What You ll Learn. Active Vocabulary
2-1 Inductive Reasoning and Conjecture What You ll Learn Scan Lesson 2-1. List two headings you would use to make an outline of this lesson. 1. Active Vocabulary 2. New Vocabulary Fill in each blank with
More informationCSE 1400 Applied Discrete Mathematics Proofs
CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4
More informationTHE LOGIC OF COMPOUND STATEMENTS
CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form
More informationCHAPTER 6. Copyright Cengage Learning. All rights reserved.
CHAPTER 6 SET THEORY Copyright Cengage Learning. All rights reserved. SECTION 6.4 Boolean Algebras, Russell s Paradox, and the Halting Problem Copyright Cengage Learning. All rights reserved. Boolean Algebras,
More informationProof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:
Proof Terminology Proof Techniques (Rosen, Sections 1.7 1.8) TOPICS Direct Proofs Proof by Contrapositive Proof by Contradiction Proof by Cases Theorem: statement that can be shown to be true Proof: a
More informationBasic Logic and Proof Techniques
Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely
More informationEuclid Geometry And Non-Euclid Geometry. Have you ever asked yourself why is it that if you walk to a specific place from
Hu1 Haotian Hu Dr. Boman Math 475W 9 November 2016 Euclid Geometry And Non-Euclid Geometry Have you ever asked yourself why is it that if you walk to a specific place from somewhere, you will always find
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationPropositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38
Propositional Logic Jason Filippou CMSC250 @ UMCP 05-31-2016 ason Filippou (CMSC250 @ UMCP) Propositional Logic 05-31-2016 1 / 38 Outline 1 Syntax 2 Semantics Truth Tables Simplifying expressions 3 Inference
More information1 FUNDAMENTALS OF LOGIC NO.1 WHAT IS LOGIC Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 Course Summary What is the correct deduction? Since A, therefore B. It is
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationTopic 1: Propositional logic
Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements
More informationp, p or its negation is true, and the other false
Logic and Proof In logic (and mathematics) one often has to prove the truthness of a statement made. A proposition is a (declarative) sentence that is either true or false. Example: An odd number is prime.
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More informationCOT 2104 Homework Assignment 1 (Answers)
1) Classify true or false COT 2104 Homework Assignment 1 (Answers) a) 4 2 + 2 and 7 < 50. False because one of the two statements is false. b) 4 = 2 + 2 7 < 50. True because both statements are true. c)
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationMath Final Exam December 14, 2009 Page 1 of 5
Math 201-803-Final Exam December 14, 2009 Page 1 of 5 (3) 1. Evaluate the expressions: (a) 10 C 4 (b) 10 P 4 (c) 15!4! 3!11! (4) 2. (a) In how many ways can a president, a vice president and a treasurer
More informationMath 13, Spring 2013, Lecture B: Midterm
Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.
More informationUnary negation: T F F T
Unary negation: ϕ 1 ϕ 1 T F F T Binary (inclusive) or: ϕ 1 ϕ 2 (ϕ 1 ϕ 2 ) T T T T F T F T T F F F Binary (exclusive) or: ϕ 1 ϕ 2 (ϕ 1 ϕ 2 ) T T F T F T F T T F F F Classical (material) conditional: ϕ 1
More informationClass IX Chapter 5 Introduction to Euclid's Geometry Maths
Class IX Chapter 5 Introduction to Euclid's Geometry Maths Exercise 5.1 Question 1: Which of the following statements are true and which are false? Give reasons for your answers. (i) Only one line can
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationExample. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives
Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More informationThe statement calculus and logic
Chapter 2 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 You will have encountered several languages
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationPropositional Logic: Syntax
Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic
More informationcse541 LOGIC FOR COMPUTER SCIENCE
cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax
More informationChapter 2: Introduction to Propositional Logic
Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:
More informationA statement is a sentence that is definitely either true or false but not both.
5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1
EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1 Getting Started In order to be fluent in mathematical statements, you need to understand the basic framework of the language
More informationSymbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.
Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables
More informationP1-763.PDF Why Proofs?
P1-763.PDF Why Proofs? During the Iron Age men finally started questioning mathematics which eventually lead to the creating of proofs. People wanted to know how and why is math true, rather than just
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationMath 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1
Math 300 Introduction to Mathematical Reasoning Autumn 2017 Proof Templates 1 In its most basic form, a mathematical proof is just a sequence of mathematical statements, connected to each other by strict
More informationGrade 7/8 Math Circles. Mathematical Thinking
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles March 22 & 23 2016 Mathematical Thinking Today we will take a look at some of the
More informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More informationMath 144 Summer 2012 (UCR) Pro-Notes June 24, / 15
Before we start, I want to point out that these notes are not checked for typos. There are prbally many typeos in them and if you find any, please let me know as it s extremely difficult to find them all
More informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: Proposition logic MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 12, 2017 Outline 1 Propositions 2 Connectives
More informationMA103 STATEMENTS, PROOF, LOGIC
MA103 STATEMENTS, PROOF, LOGIC Abstract Mathematics is about making precise mathematical statements and establishing, by proof or disproof, whether these statements are true or false. We start by looking
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.
More informationElementary Linear Algebra, Second Edition, by Spence, Insel, and Friedberg. ISBN Pearson Education, Inc., Upper Saddle River, NJ.
2008 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. APPENDIX: Mathematical Proof There are many mathematical statements whose truth is not obvious. For example, the French mathematician
More informationSection 1.2: Conditional Statements
Section 1.2: Conditional Statements In this section, we study one of the most important tools in logic - conditional statements. Loosely speaking, conditional statements are statements of the form if p
More informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More informationPropositional logic ( ): Review from Mat 1348
CSI 2101 / Winter 2008: Discrete Structures. Propositional logic ( 1.1-1.2): Review from Mat 1348 Dr. Nejib Zaguia - Winter 2008 1 Propositional logic: Review Mathematical Logic is a tool for working with
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationLecture 4: Proposition, Connectives and Truth Tables
Discrete Mathematics (II) Spring 2017 Lecture 4: Proposition, Connectives and Truth Tables Lecturer: Yi Li 1 Overview In last lecture, we give a brief introduction to mathematical logic and then redefine
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 26 Why Study Logic?
More informationCambridge University Press How to Prove it: A Structured Approach: Second edition Daniel J. Velleman Excerpt More information
Introduction What is mathematics? High school mathematics is concerned mostly with solving equations and computing answers to numerical questions. College mathematics deals with a wider variety of questions,
More informationMathematical Logic. Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. Chiara Ghidini. FBK-IRST, Trento, Italy
Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. FBK-IRST, Trento, Italy Deciding logical consequence Problem Is there an algorithm to determine whether a formula
More informationfrom Euclid to Einstein
WorkBook 2. Space from Euclid to Einstein Roy McWeeny Professore Emerito di Chimica Teorica, Università di Pisa, Pisa (Italy) A Pari New Learning Publication Book 2 in the Series WorkBooks in Science (Last
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationSection 2.1: Introduction to the Logic of Quantified Statements
Section 2.1: Introduction to the Logic of Quantified Statements In the previous chapter, we studied a branch of logic called propositional logic or propositional calculus. Loosely speaking, propositional
More informationThe following statements are conditional: Underline each hypothesis and circle each conclusion.
Geometry Unit 2 Reasoning and Proof 2-1 Conditional Statements Conditional Statement a statement which has a hypothesis and conclusion, often called an if-then statement. Conditional statements are contain
More informationEUCLID S AXIOMS A-1 A-2 A-3 A-4 A-5 CN-1 CN-2 CN-3 CN-4 CN-5
EUCLID S AXIOMS In addition to the great practical value of Euclidean Geometry, the ancient Greeks also found great aesthetic value in the study of geometry. Much as children assemble a few kinds blocks
More informationChapter 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
More informationGlossary of Logical Terms
Math 304 Spring 2007 Glossary of Logical Terms The following glossary briefly describes some of the major technical logical terms used in this course. The glossary should be read through at the beginning
More informationInduction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2
Induction 0-8-08 Induction is used to prove a sequence of statements P(), P(), P(3),... There may be finitely many statements, but often there are infinitely many. For example, consider the statement ++3+
More informationDeduction by Daniel Bonevac. Chapter 3 Truth Trees
Deduction by Daniel Bonevac Chapter 3 Truth Trees Truth trees Truth trees provide an alternate decision procedure for assessing validity, logical equivalence, satisfiability and other logical properties
More informationManual of Logical Style (fresh version 2018)
Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More information1 Propositional Logic
CS 2800, Logic and Computation Propositional Logic Lectures Pete Manolios Version: 384 Spring 2011 1 Propositional Logic The study of logic was initiated by the ancient Greeks, who were concerned with
More informationCMA Geometry Unit 1 Introduction Week 2 Notes
CMA Geometry Unit 1 Introduction Week 2 Notes Assignment: 9. Defined Terms: Definitions betweenness of points collinear points coplanar points space bisector of a segment length of a segment line segment
More informationMathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 15 Propositional Calculus (PC) So, now if you look back, you can see that there are three
More informationPHIL12A Section answers, 16 February 2011
PHIL12A Section answers, 16 February 2011 Julian Jonker 1 How much do you know? 1. Show that the following sentences are equivalent. (a) (Ex 4.16) A B A and A B A B (A B) A A B T T T T T T T T T T T F
More informationEquivalence and Implication
Equivalence and Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February 7 8, 2018 Alice E. Fischer Laws of Logic... 1/33 1 Logical Equivalence Contradictions and Tautologies 2 3 4 Necessary
More informationFlat Geometry. Spherical Geometry
The Geometry of the Universe What does the constant k in the Friedmann equation really mean? In this lecture we will follow Chapter 4 of Liddle to show that it has close connections with the geometry of
More information8. TRANSFORMING TOOL #1 (the Addition Property of Equality)
8 TRANSFORMING TOOL #1 (the Addition Property of Equality) sentences that look different, but always have the same truth values What can you DO to a sentence that will make it LOOK different, but not change
More informationChapter 1. Logic and Proof
Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known
More informationIntroduction Propositional Logic. Discrete Mathematics Andrei Bulatov
Introduction Propositional Logic Discrete Mathematics Andrei Bulatov Discrete Mathematics Propositional Logic 2-2 What is Logic? Computer science is a mere continuation of logic by other means Georg Gottlob
More informationProof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory
Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should
More informationWriting Mathematical Proofs
Writing Mathematical Proofs Dr. Steffi Zegowitz The main resources for this course are the two following books: Mathematical Proofs by Chartrand, Polimeni, and Zhang How to Think Like a Mathematician by
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.6 Indirect Argument: Contradiction and Contraposition Copyright Cengage Learning. All
More informationSolutions to Exercises in Chapter 1
Solutions to Exercises in hapter 1 1.6.1 heck that the formula 1 a c b d works for rectangles but not for 4 parallelograms. b a c a d d b c FIGURE S1.1: Exercise 1.6.1. rectangle and a parallelogram For
More informationSymbolic Logic Outline
Symbolic Logic Outline 1. Symbolic Logic Outline 2. What is Logic? 3. How Do We Use Logic? 4. Logical Inferences #1 5. Logical Inferences #2 6. Symbolic Logic #1 7. Symbolic Logic #2 8. What If a Premise
More informationUnit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9
Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationPropositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.
Propositional Logic Winter 2012 Propositional Logic: Section 1.1 Proposition A proposition is a declarative sentence that is either true or false. Which ones of the following sentences are propositions?
More information