Truth Table Definitions of Logical Connectives
|
|
- Winifred Perkins
- 6 years ago
- Views:
Transcription
1 Truth Table Definitions of Logical Connectives 1. Truth Functions: Logicians DEFINE logical operators in terms of their relation to the truth or falsehood of the statement(s) that they are operating on. A. Negation: Let s consider negation first. If we have P, what happens when P is TRUE? What happens when P is FALSE? To answer these questions, let s take an example: It is not the case that it is raining. Translation: P Here, P = it is raining. First, imagine that it IS raining (i.e., it is raining is true). In that case, It is not the case that it is raining would be a LIE. It would be FALSE. Now, imagine that it is NOT raining (i.e., it is raining is false). In that case, It is not the case that it is raining would be telling the TRUTH. It would be TRUE. In short, when P is true, P is false. But, when P is false, P is true. Basically, negation just takes the truth value of the thing being negated and makes it the OPPOSITE of whatever it is. For instance, since The sky is blue is TRUE, then It is NOT the case that the sky is blue is false. This relation of the dash operator ( ) to the truth of the propositions being operated on ( P ) is called the truth function of that operator. And it can be expressed in a truth table, like this one ( T means True and F means False ): Negation P P T F F T Basically, this says that, when P is true, P is false. And when P is false, P is true. Examples: It is not the case that the moon is made of cheese is true because the moon is made of cheese is false. It is not the case that grass is green is false because grass is green is true. 1
2 B. Conjunction: All of the other operators require TWO statements, P AND Q. What is the relation between and the truth or falsehood of P and Q? Well, it turns out that P Q is ONLY true when BOTH P AND Q are true. It will not do to have only one or the other be true. They must BOTH be true. Consider some examples: P and Q are true: The sky is blue and grass is green. P is true, but Q is false: Grass is green and dogs are birds. P is false, but Q is true: Snakes are insects and the sky is blue. P and Q are both false: Snakes are insects and dogs are birds. (this sentence is true) (this sentence is false) (this sentence is false) (this sentence is false) We can write the truth table for as follows: Conjunction P Q P Q T T T T F F F T F F F F C. Disjunction: What is the relation between the operator and the truth or falsehood of P and Q? Well, it turns out P Q is ONLY false when BOTH P AND Q are false. Consider some examples: P and Q are true: The sky is blue or grass is green. P is true, but Q is false: Grass is green or dogs are birds. P is false, but Q is true: Snakes are insects or the sky is blue. P and Q are both false: Snakes are insects or dogs are birds. (this sentence is true) (this sentence is true because grass is green) (this sentence is true because the sky is blue) (this sentence is false) 2
3 We can write the truth table for as follows: Disjunction P Q P Q T T T T F T F T T F F F Note: If the first line seems counter-intuitive, that is because or is INCLUSIVE. Read on. Or is inclusive: If line-1 seems counter-intuitive, note that this is because we have interpreted or as being inclusive. This makes sense in many contexts. For instance, when I say that I will eat strawberry OR chocolate ice cream and you hand me a bowl with BOTH strawberry and chocolate ice cream, what I have said does not automatically mean that I would refuse the dish. What or means here, then, is that AT LEAST one of the two disjuncts must be true. But, maybe they could BOTH be true as well. So, we say that or is inclusive. But, sometimes, we DO use the word or to be exclusive. For instance, I might say that, Timmy is either five or six years old. Surely I do not mean to allow that Timmy might also be five AND six years old. That is impossible. I mean or to be EXCLUSIVE here. That is, if Timmy is five, then this excludes the possibility of him being six, and vice versa. Now, there IS a way to account for an EXCLUSIVE or. We would do it like this: (F S) (F S) What this says is that Timmy is either five or six, AND he is NOT both five AND six. This is how we capture the idea behind the word or when it is meant to be exclusive. (We will discuss these more complicated sorts of statements soon.) D. Conditional: What is the relation between the operator and the truth or falsehood of P and Q? Well, it turns out that P Q is ONLY false when P (the antecedent) is true, and Q (the consequent) is false. Note: Students sometimes find this counter-intuitive, because it seems like P Q should turn out to be FALSE when both P and Q are false. For instance, If the moon is made of cheese, then unicorns are invading the capitol seems totally false, but it turns out to be TRUE according to the definition of that I have just given. 3
4 To understand why is defined this way, it may help to consider a scenario, and ask yourself: In which of these four scenarios did I tell a lie? I say to you, If you come over and help me move my couch on Saturday, then I will buy you some pizza. Translation: P Q Scenario 1: You DO help me, and I DO buy you pizza (P and Q are both true). Scenario 2: You DO help me, but I do NOT buy you pizza (P is true, Q is false). Scenario 3: You do NOT help me, but I DO buy you pizza anyway (P is false, Q is true). Scenario 4: You do NOT help me, and I do NOT buy you pizza (P and Q are both false). Now, in which of these four scenarios did I tell a lie, or break my promise to you? It seems that I ONLY told a lie in the scenario where you DID come over to help me, but I did NOT buy you pizza. So, P Q is only false when P is true and Q is false. Alternatively, think of it this way: Which of the 4 people are breaking this law? Law: If someone is consuming alcohol, then they are at least 21 years of age. Scenario 1: Peggy IS consuming alcohol, and IS over 21 (P and Q are both true). Scenario 2: Sue IS consuming alcohol, but is NOT over 21 (P is true, Q is false). Scenario 3: Billy is NOT consuming alcohol, but IS over 21 (P is false, Q is true). Scenario 4: Jean is NOT consuming alcohol, and is NOT over 21 (P and Q are both false). ONLY SUE is breaking the law. Again, P Q is only violated when P is true and Q is false. We can write the truth table for as follows: Conditional P Q P Q T T T T F F F T T F F T E. Bi-Conditional: Imagine that I say: Peggy will go to the party if and only if Quinn goes to the party. There are four possible scenarios. Ask yourself: In which of these four scenarios is the statement above a lie? 4
5 Scenario 1: Peggy goes to the party, AND Quinn goes too. (P and Q are both true). Scenario 2: Peggy goes to the party, but Quinn does NOT go. (P is true, Q is false). Scenario 3: Peggy does NOT go to the party, but Quinn does go. (P is false, Q is true). Scenario 4: Peggy does NOT go, and neither does Quinn. (P and Q are both false). If I say that Peggy will go if and ONLY if Quinn goes, I have told a lie in scenarios 2 and 3, but I have NOT lied in scenarios 1 and 4. In short, for P Q to be true, P and Q must either BOTH be false, or else they must BOTH be true. They must stand or fall together. We can write the truth table for as follows: Bi-Conditional P Q P Q T T T T F F F T F F F T Remember that P Q is just shorthand for (P Q) (Q P). This is a conjunction. (This is because, as we will soon learn the main operator in this formula is the.) But, conjunctions such as P Q only comes out true when P and Q are BOTH true. So, likewise, (P Q) (Q P) only comes out true when BOTH conjuncts (P Q) AND (Q P) are true. We now have a complete set of definitions for our 5 logical operators! 5
6 Compound Statements and Well-Formed Formulae So far, we have (mostly) only looked at statements where there is ONE operator (for instance, A, A B, A B, A B, and A B ). Each of these has only ONE operator. But, often, statements can be much more complicated than this, and require TWO or more operators. For instance, we already saw one such statement: (F S) (F S) Recall that this meant, He is either five or six, and he is not both five and six. Notice the words in bold ( or, and, not, and and ). Each of these four words are operators, and so the symbolic translation requires FOUR operator symbols. But, we can t write the statement above just ANY old way. The statement above is a well-formed formula. A well-formed formula is a formula which does not violate any of the rules for symbolic formulas. Here are several rules of thumb for formulas: 1) Two statement letters can never appear side by side; they must always be separated by an operator (and they cannot be separated ONLY by a ). The following are NOT well-formed formulas: AB AB A BC A B NO! To see that these sentences are counter-intuitive, consider how poorly they would look if we translated them into English: Albert likes cheddar Brenda likes swiss. It is not the case that Albert likes cheddar Brenda likes swiss. Either Albert likes cheddar or Brenda likes swiss Charlie likes mozzarella. Albert likes cheddar not Brenda likes swiss. 2) All operators except must have something on either side of them, and the must have something on its right side. The following are NOT well-formed formulas: NO! A B ( needs something on both sides of it) A ( must go on the left) A ( needs something on both sides of it) 6
7 3) Two operators can never appear side by side unless the second is a. The following are NOT well-formed formulas: A B A B A A NO! (note: this one violates rule 2: needs something on both sides of it) Meanwhile, the following IS a well-formed formula: A B 4) Statements with three or more letters must have parentheses or brackets. Brackets are sort of like commas in English sentences. For instance, the following sentence is ambiguous: Buddy likes cheese and Peggy likes pepperoni or Sue likes Hawaiian. We might be tempted to symbolize this statement as the following: B P S But, which of the following is the speaker saying? Either Buddy likes cheese and Peggy likes pepperoni OR Sue likes Hawaiian. OR Buddy likes cheese AND Either Peggy likes pepperoni or Sue likes Hawaiian. It s ambiguous, and there is an important difference. Commas would help to clarify things. If we add commas to these two interpretations, we get the following: Buddy likes cheese and Peggy likes pepperoni, or Sue likes Hawaiian. Buddy likes cheese, and Peggy likes pepperoni or Sue likes Hawaiian. The commas represent separators, just like parentheses do. Here are the symbolizations: (B P) S B (P S) 7
8 In the first sentence, Buddy and Peggy occur together, while Sue is separated by a comma. This indicates that the claim about Buddy and Peggy come together as a single unit. In logic, we indicate this by putting parentheses around them. Meanwhile, in the second sentence, Buddy occurs alone, and Peggy and Sue occur together after the comma. So, we put parentheses around Peggy and Sue in the second formula. But, there won t always be a comma. The placement of the word either can be helpful in these cases. For instance, notice the difference between the following two sentences: Either Harry orders juice and Mark orders beer or John orders soda. Harry orders juice and either Mark orders beer or John orders soda. These get symbolized as the following: (H M) J H (M J) Here are a few more sentences and their translations: Harry likes juice or both Mark and John like soda. H (M J) Harry likes juice and Mark or John like soda. H (M J) If Harry orders juice, then, if Mark orders beer, then John will order soda. H (M J) If Harry will order juice provided that Mark orders beer, then John will order soda. (M H) J If both Harry and Mark order juice or John orders beer, then Larry will order water. [(H M) J] L 8
9 Identifying the Main Operator Before moving on, we must learn how to identify the main operator within a formula. The main operator determines which KIND of statement a statement is (e.g., negation, conjunction, disjunction, etc.). Here are two rules for finding the main operator : 1) If there ARE NO parentheses, then the main operator will be the ONLY operator unless there is more than one operator, in which case the main operator is the operator that is the one that is not a. 2) If there ARE parentheses or brackets, then the main operator will be the ONLY operator which is outside of all of the parenthesis or brackets unless there is more than one operator outside of the parenthesis/brackets, in which case the main operator is the one that is not a. Here are some examples. Negation: In the following formulas, the main operator is the. So the following compound statements are all negations: A (A B) [(A B) (C D)] Conjunction: In the following formulas, the main operator is the. So the following compound statements are all conjunctions: A B A B (A B) (C D) A [(B C) (D E)] Disjunction: In the following formulas, the main operator is the. So the following compound statements are all disjunctions: A B A B (A B) (C D) A [(B C) (D E)] 9
10 Conditional: In the following formulas, the main operator is the. So the following compound statements are all conditionals: A B A B (A B) (C D) [(A B) (C D)] E Bi-Conditional: In the following formulas, the main operator is the. So the following compound statements are all bi-conditionals: A B A B (A B) (B C) [A (B C)] [D (E F)] Once we have found the main operator, we know what KIND of statement something is. This becomes very clear if you note that, we can represent all of the complicated symbolizations above as very simple ones with a single operator. If Δ and are wff s: ALL of the negations above have the form, ALL of the conjunctions above have the form, Δ ALL of the disjunctions above have the form, Δ ALL of the conditionals above have the form, Δ ALL of the bi-conditionals above have the form, Δ For instance, take the very last equation under the bi-conditionals above. Now: In that case Let Δ = [A (B C)] and Let = [D (E F)] [A (B C)] [D (E F)] is really just an instance of a well-formed formula of the form: Δ i.e., this is really just a bi-conditional with a wff on either side of the double-arrow. 10
11 Determining the Truth Values of Compound Statements If I give you an easy statement, such as A B and tell you that A is true and B is false, then you would easily be able to tell me that A B is false. (Have a look at the truth table for and see that P Q ONLY comes out true if BOTH conjuncts are true. Example #1: But, let s try a harder one: If either Trump or Clinton wins the election, then the world will end in Jan., In symbolic form, this becomes: (T C) W But we know that: T=True, C=False, and W=False (Trump DID win, Clinton DIDN T, and the world DID NOT end) Using T for True and F for False, we can re-write this as follows: (T F) F The main operator in the formula above is the. We get rid of one operator at a time, and save the main operator for last. So, first let s focus on the T F portion of the formula. What is the truth value of P Q when P is true and Q is false? It s true! So, we know that T F is true. We can replace the entire disjunction with a T, like this: T F Now, what is the truth value of P Q when P is true and Q is false? It s false! So, the WHOLE sentence that we originally started with is false; i.e., If either Trump or Clinton wins the election, then the world will end in Jan., 2017 is FALSE. Example #2: Here is another example: [(A B) (C D)] A=true, B=true, C=true, D=false Is this sentence true or false? Referring to our truth tables, we get the following steps: [(T T) (T F)] (we replace the letters with T or F ) ( T F ) (the first conjunction is true; the second one is false) T (the disjunction is true) F (the negation of a truth is a falsehood) Answer: So [(A B) (C D)] is false when A=true, B=true, C=true, and D=false. 11
12 Example #3: Let s try one more example: [A (B C)] [D (E F)] A=false, B=true, C=false, D=false, E=true, F=false Is this sentence true or false? Using our truth tables above, we get the following steps: [F (T F)] [F (T F)] (we replace the letters with T or F ) (F F ) (F F ) (both of the conditionals in the parentheses are false) F F (both of the disjunctions are false) T (a bi-conditional is TRUE when both sides are false) Answer: True 12
Truth Tables for Propositions
Truth Tables for Propositions 1. Truth Tables for 2-Letter Compound Statements: We have learned about truth tables for simple statements. For instance, the truth table for A B is the following: Conditional
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 informationDerivations, part 2. Let s dive in to some derivations that require the use of the last four rules:
Derivations, part 2 Let s dive in to some derivations that require the use of the last four rules: 1. I Derivations: Let s start with some derivations that use conditional-introduction. (a) Here s an easy
More informationChoosing Logical Connectives
Choosing Logical Connectives 1. Too Few Connectives?: We have chosen to use only 5 logical connectives in our constructed language of logic, L1 (they are:,,,, and ). But, we might ask, are these enough?
More informationElla failed to drop the class. Ella dropped the class.
Propositional logic In many cases, a sentence is built up from one or more simpler sentences. To see what follows from such a complicated sentence, it is helpful to distinguish the simpler sentences from
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 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 informationSection 1.1: Logical Form and Logical Equivalence
Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,
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 informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationTRUTH TABLES LOGIC (CONTINUED) Philosophical Methods
TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods Here s some Vocabulary we will be talking about in this PowerPoint. Atomic Sentences: Statements which express one proposition Connectives: These are
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 informationTruth Tables for Arguments
ruth ables for Arguments 1. Comparing Statements: We ve looked at SINGLE propositions and assessed the truth values listed under their main operators to determine whether they were tautologous, self-contradictory,
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 informationSolving Equations by Adding and Subtracting
SECTION 2.1 Solving Equations by Adding and Subtracting 2.1 OBJECTIVES 1. Determine whether a given number is a solution for an equation 2. Use the addition property to solve equations 3. Determine whether
More informationChapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.
Chapter 1 Chapter Summary Propositional Logic The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.3) Predicate Logic The Language of Quantifiers (1.4) Logical Equivalences (1.4)
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 informationLOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.
LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,
More informationDiscrete Mathematical Structures. Chapter 1 The Foundation: Logic
Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction
More informationPropositions. Frequently, we will use the word statement instead of proposition.
Propositional Logic Propositions A proposition is a declaration of fact that is either true or false, but not both. Examples and non-examples: One plus two equals four (proposition) Mozart is the greatest
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 information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More information1 Propositional Logic
1 Propositional Logic Required reading: Foundations of Computation. Sections 1.1 and 1.2. 1. Introduction to Logic a. Logical consequences. If you know all humans are mortal, and you know that you are
More informationPropositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More information3.2: Compound Statements and Connective Notes
3.2: Compound Statements and Connective Notes 1. Express compound statements in symbolic form. _Simple_ statements convey one idea with no connecting words. _Compound_ statements combine two or more simple
More informationWe have seen that the symbols,,, and can guide the logical
CHAPTER 7 Quantified Statements We have seen that the symbols,,, and can guide the logical flow of algorithms. We have learned how to use them to deconstruct many English sentences into a symbolic form.
More informationQuantifiers Here is a (true) statement about real numbers: Every real number is either rational or irrational.
Quantifiers 1-17-2008 Here is a (true) statement about real numbers: Every real number is either rational or irrational. I could try to translate the statement as follows: Let P = x is a real number Q
More information5. And. 5.1 The conjunction
5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language
More informationPropositional Languages
Propositional Logic Propositional Languages A propositional signature is a set/sequence of primitive symbols, called proposition constants. Given a propositional signature, a propositional sentence is
More informationFinal Exam Theory Quiz Answer Page
Philosophy 120 Introduction to Logic Final Exam Theory Quiz Answer Page 1. (a) is a wff (and a sentence); its outer parentheses have been omitted, which is permissible. (b) is also a wff; the variable
More informationTo reason to a correct conclusion, we must build our arguments on true statements. Sometimes it is helpful to use truth tables. Simple Truth Table p
Geometry Week 9 Sec 5.3 and 5.4 section 5.3 To reason to a correct conclusion, we must build our arguments on true statements. Sometimes it is helpful to use truth tables. Simple Truth Table p T F p F
More informationSection 3.1 Statements, Negations, and Quantified Statements
Section 3.1 Statements, Negations, and Quantified Statements Objectives 1. Identify English sentences that are statements. 2. Express statements using symbols. 3. Form the negation of a statement 4. Express
More informationChapter 1: Formal Logic
Chapter 1: Formal Logic Dr. Fang (Daisy) Tang ftang@cpp.edu www.cpp.edu/~ftang/ CS 130 Discrete Structures Logic: The Foundation of Reasoning Definition: the foundation for the organized, careful method
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (oday) Basic logical connectives. ruth tables. Logical
More informationNumbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:
3.4 THE CONDITIONAL & BICONDITIONAL Definition. Any statement that can be put in the form If p, then q, where p and q are basic statements, is called a conditional statement and is written symbolically
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the defnitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical
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 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 informationNotes for Recitation 1
6.042/18.062J Mathematics for Computer Science September 10, 2010 Tom Leighton and Marten van Dijk Notes for Recitation 1 1 Logic How can one discuss mathematics with logical precision, when the English
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationGENERAL MATHEMATICS 11
THE SEED MONTESSORI SCHOOL GENERAL MATHEMATICS 11 Operations on Propositions July 14, 2016 WORK PLAN Daily Routine Objectives Recall Lesson Proper Practice Exercises Exit Card DAILY DOSE On ¼ sheet of
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 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 informationCHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC
CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,
More informationTecniche di Verifica. Introduction to Propositional Logic
Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called
More informationColette Sciberras, PhD (Dunelm) 2016 Please do not distribute without acknowledging the author!
Philosophy A/ Int. Level: Logic Notes and Readings Colette Sciberras, PhD (Dunelm) 2016 Please do not distribute without acknowledging the author! PART 1: Readings from Copi: Introduction to Logic. Deduction
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 informationDiscrete Mathematics and Applications COT3100
Discrete Mathematics and Applications CO3100 Dr. Ungor Sources: Slides are based on Dr. G. Bebis material. uesday, January 7, 2014 oundations of Logic: Overview Propositional logic: (Sections 1.1-1.3)
More informationArguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion)
Arguments and Proofs For the next section of this course, we will study PROOFS. A proof can be thought of as the formal representation of a process of reasoning. Proofs are comparable to arguments, since
More information5. And. 5.1 The conjunction
5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural 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 informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical
More informationDiscrete Structures of Computer Science Propositional Logic I
Discrete Structures of Computer Science Propositional Logic I Gazihan Alankuş (Based on original slides by Brahim Hnich) July 26, 2012 1 Use of Logic 2 Statements 3 Logic Connectives 4 Truth Tables Use
More informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More informationPropositional Logic Translation, 6.1. I. The form of an argument
Philosophy 109, Modern Logic, Queens College Russell Marcus, Instructor email: philosophy@thatmarcusfamily.org website: http://philosophy.thatmarcusfamily.org Office phone: (718) 997-5287 Propositional
More informationCHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC
1 CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC Here, you ll learn: what it means for a logic system to be finished some strategies for constructing proofs Congratulations! Our system of
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 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 informationSection 3.1. Statements and Logical Connectives. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 3.1 Statements and Logical Connectives What You Will Learn Statements, quantifiers, and compound statements Statements involving the words not, and, or, if then, and if and only if 3.1-2 HISORY
More informationAn Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04
An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04 1 A Taste of Logic Logic puzzles (1) Knights and Knaves Knights: always tell the truth Knaves: always lie You encounter two people A and B. A says:
More informationPL: Truth Trees. Handout Truth Trees: The Setup
Handout 4 PL: Truth Trees Truth tables provide a mechanical method for determining whether a proposition, set of propositions, or argument has a particular logical property. For example, we can show that
More informationSection 1.3. Let I be a set. When I is used in the following context,
Section 1.3. Let I be a set. When I is used in the following context, {B i } i I, we call I the index set. The set {B i } i I is the family of sets of the form B i where i I. One could also use set builder
More informationDEDUCTIVE REASONING Propositional Logic
7 DEDUCTIVE REASONING Propositional Logic Chapter Objectives Connectives and Truth Values You will be able to understand the purpose and uses of propositional logic. understand the meaning, symbols, and
More informationSupplementary Logic Notes CSE 321 Winter 2009
1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious
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 informationIndicative conditionals
Indicative conditionals PHIL 43916 November 14, 2012 1. Three types of conditionals... 1 2. Material conditionals... 1 3. Indicatives and possible worlds... 4 4. Conditionals and adverbs of quantification...
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 informationFormal Logic. Critical Thinking
ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,
More informationLogic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies
Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Valentin Stockholm University September 2016 Propositions Proposition:
More information10 LOGIC Introduction. Objectives
10 LOGIC Chapter 10 Logic Objectives After studying this chapter you should understand the nature of propositional logic; understand the connectives NOT, OR, AND; understand implication and equivalence;
More informationOverview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions
Note 01 Propositional Logic 1 / 10-1 Overview 1. Introduction to Propositional Logic 2. Operations on Propositions 3. Truth Tables 4. Translating Sentences into Logical Expressions 5. Preview: Propositional
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 informationFUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN
021 McLoughlin Handout 1.3, page 1 of 6 FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN Truth Table for Not K K T F F T Truth Table for And B M B M T F F F T F F F F Truth Table for Or R S R S T
More informationExamples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.
Examples Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Example (1) Solve x 2 + (y 1) 2 = 0. The solution is x = 0 AND y = 1. [p q.] Example (2) Solve x(y 1) = 0. Examples Let
More informationThe paradox of knowability, the knower, and the believer
The paradox of knowability, the knower, and the believer Last time, when discussing the surprise exam paradox, we discussed the possibility that some claims could be true, but not knowable by certain individuals
More informationMathematical Reasoning. The Foundation of Algorithmics
Mathematical Reasoning The Foundation of Algorithmics The Nature of Truth In mathematics, we deal with statements that are True or False This is known as The Law of the Excluded Middle Despite the fact
More informationPredicates, Quantifiers and Nested Quantifiers
Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x
More informationSection 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese
Section 1.1 Propositional Logic proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese go to town! X - imperative What time is it? X - interrogative propositional
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationINTRODUCTION TO LOGIC 3 Formalisation in Propositional Logic
Introduction INRODUCION O LOGIC 3 Formalisation in Propositional Logic Volker Halbach If I could choose between principle and logic, I d take principle every time. Maggie Smith as Violet Crawley in Downton
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 informationSolving with Absolute Value
Solving with Absolute Value Who knew two little lines could cause so much trouble? Ask someone to solve the equation 3x 2 = 7 and they ll say No problem! Add just two little lines, and ask them to solve
More informationFoundation of proofs. Jim Hefferon.
Foundation of proofs Jim Hefferon http://joshua.smcvt.edu/proofs The need to prove In Mathematics we prove things To a person with a mathematical turn of mind, the base angles of an isoceles triangle are
More information1 The Foundations. 1.1 Logic. A proposition is a declarative sentence that is either true or false, but not both.
he oundations. Logic Propositions are building blocks of logic. A proposition is a declarative sentence that is either true or false, but not both. Example. Declarative sentences.. Ottawa is the capital
More information33. SOLVING LINEAR INEQUALITIES IN ONE VARIABLE
get the complete book: http://wwwonemathematicalcatorg/getfulltextfullbookhtm 33 SOLVING LINEAR INEQUALITIES IN ONE VARIABLE linear inequalities in one variable DEFINITION linear inequality in one variable
More informationPropositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.
Propositional Logic Yimei Xiang yxiang@fas.harvard.edu 11 February 2014 1 Review Recursive definition Set up the basis Generate new members with rules Exclude the rest Subsets vs. proper subsets Sets of
More informationLING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic
LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, 2016 Propositional logic 1 Vocabulary of propositional logic Vocabulary (1) a. Propositional letters: p, q, r, s, t, p 1, q 1,..., p 2, q 2,...
More informationBefore you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.
Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will
More information4 Derivations in the Propositional Calculus
4 Derivations in the Propositional Calculus 1. Arguments Expressed in the Propositional Calculus We have seen that we can symbolize a wide variety of statement forms using formulas of the propositional
More informationChapter 5 Simplifying Formulas and Solving Equations
Chapter 5 Simplifying Formulas and Solving Equations Look at the geometry formula for Perimeter of a rectangle P = L W L W. Can this formula be written in a simpler way? If it is true, that we can simplify
More information22 3. STATEMENTS. P : 2 is an even number
Chapter II Logic I am convinced that the act of thinking logically cannot possibly be natural to the human mind. If it were, then mathematics would be everybody s easiest course at school and our species
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 informationChapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.
Chapter 3: Logic Diana Pell Section 3.1: Statements and Quantifiers A statement is a declarative sentence that is either true or false, but not both. Exercise 1. Decide which of the following are statements
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 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 informationThe Nature of Mathematics 13th Edition, Smith Notes. Korey Nishimoto Math Department, Kapiolani Community College October
Mathematics 13th Edition, Smith Notes Korey Nishimoto Math Department, Kapiolani Community College October 9 2017 Expanded Introduction to Mathematical Reasoning Page 3 Contents Contents Nature of Logic....................................
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 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 information