Lecture 1: Propositional Logic (I)
|
|
- Randell Ray
- 5 years ago
- Views:
Transcription
1 Lecture 1: Propositional Logic (I) Fadoua Ghourabi Ochanomizu University Octobre 12, / 36
2 Contents 1 Declarative sentences 2 Constructing propositions 3 Quizz 4 Natural deduction Rules for conjunction Rules for double negation 2 / 36
3 First examples Is this reasoning correct? Example 1.1 If the train arrives late and there are no taxis at the station, then John is late for his meeting. John is not late for his meeting. The train did arrive late. Therefore, there were taxis at the station. What do you think of the next one? Example 1.2 If it is raining and Jane does not have her umbrella with her, then she will get wet. Jane is not wet. It is raining. Therefore, Jane has her umbrella with her. 3 / 36
4 First examples Is this reasoning correct? Example 1.1 If the train arrives late and there are no taxis at the station, then John is late for his meeting. John is not late for his meeting. The train did arrive late. Therefore, there were taxis at the station. What do you think of the next one? Example 1.2 If it is raining and Jane does not have her umbrella with her, then she will get wet. Jane is not wet. It is raining. Therefore, Jane has her umbrella with her. 3 / 36
5 First examples How to prove that the reasonings in Examples 1.1 & 1.2 are correct? We first need to develop a language to model the logical reasoning in Example 1.1 & 1.2 Propositional logic (Logicomix) 4 / 36
6 Proposition Proposition is a declarative sentence which we can evaluate to True or False Examples of declarative sentences (1) The sum of 3 and 5 equals 10. (2) Prof. Ohsumi won the 2016 Nobel Prize in Physiology/Medicine (3) Jane is lying. (4) Every even natural number > 2 is the sum of two prime numbers. 5 / 36
7 Proposition Proposition is a declarative sentence which we can evaluate to True or False Examples of declarative sentences (1) The sum of 3 and 5 equals 10. (2) Prof. Ohsumi won the 2016 Nobel Prize in Physiology/Medicine (3) Jane is lying. (4) Every even natural number > 2 is the sum of two prime numbers. 5 / 36
8 Proposition Proposition is a declarative sentence which we can evaluate to True or False Examples of non-declarative sentences (1) Ready, steady, go! (2) Could you please explain what is a proposition? (3) May you find much happiness. 6 / 36
9 Proposition A language for propositional logic To translate English declarative sentences into strings of symbols To focus on the reasoning rather than the meaning To define a systematic approach to evaluate to True or False If p and not q, then r. Not r. p. Therefore, q Example 1.1 If the train arrives late and there are no taxis at the station, then John is late for his meeting. John is not late for his meeting. The train did arrive late. Therefore, there were taxis at the station. Example 1.2 If it is raining and Jane does not have her umbrella with her, then she will get wet. Jane is not wet. It is raining. Therefore, Jane has her umbrella with her. 7 / 36
10 Atom An atom is an atomic declarative sentence Atom The number 5 is even. The sun is shinning. Are these declarative sentences atoms? If the sun is shinning, then I go for a hike in the mountain. I am not late. 8 / 36
11 Atom An atom is an atomic declarative sentence Atom The number 5 is even. The sun is shinning. Are these declarative sentences atoms? If the sun is shinning, then I go for a hike in the mountain. I am not late. An atom is a non-negative sentence I am late. is an atom. I am not late. is not an atom. 8 / 36
12 Atom An atom is an atomic declarative sentence Atom The number 5 is even. The sun is shinning. Are these declarative sentences atoms? If the sun is shinning, then I go for a hike in the mountain. I am not late. An atom is a non-negative sentence I am late. is an atom. I am not late. is not an atom. 8 / 36
13 Constructing propositions Declarative sentence: If the sun is shinning and I am not sick, then I go for a hike in the mountain. (1) Single out atoms If {the sun is shinning} and not {I am sick}, then {I go for a hike in the mountain}. 9 / 36
14 Constructing propositions Declarative sentence: If the sun is shinning and I am not sick, then I go for a hike in the mountain. (1) Single out atoms If {the sun is shinning} and not {I am sick}, then {I go for a hike in the mountain}. (2) Assign symbols p, q, r,... to atoms p: The sun is shinning. q: I am sick. r : I go for a hike in the mountain. 9 / 36
15 Constructing propositions Declarative sentence: If the sun is shinning and I am not sick, then I go for a hike in the mountain. (1) Single out atoms If {the sun is shinning} and not {I am sick}, then {I go for a hike in the mountain}. (2) Assign symbols p, q, r,... to atoms p: The sun is shinning. q: I am sick. r : I go for a hike in the mountain. (3) Form a proposition by connecting atoms using logical operators If {the sun is shinning} and not {I am sick}, then {I go for a hike in the mountain}. (p ( q)) r 9 / 36
16 Constructing propositions Declarative sentence: If the sun is shinning and I am not sick, then I go for a hike in the mountain. (1) Single out atoms If {the sun is shinning} and not {I am sick}, then {I go for a hike in the mountain}. (2) Assign symbols p, q, r,... to atoms p: The sun is shinning. q: I am sick. r : I go for a hike in the mountain. (3) Form a proposition by connecting atoms using logical operators If {the sun is shinning} and not {I am sick}, then {I go for a hike in the mountain}. (p ( q)) r 9 / 36
17 Logical operators q denotes the negation of q. We say not q. example: I am not sick. q q True False False True p q denotes the conjunction of p and q. We say p and q example. The sun is shinning and I am sick. p q p q True True True False True False True False False False False False 10 / 36
18 Logical operators q denotes the negation of q. We say not q. example: I am not sick. q q True False False True p q denotes the conjunction of p and q. We say p and q example. The sun is shinning and I am sick. p q p q True True True False True False True False False False False False 10 / 36
19 Logical operators p q denotes the disjunction of p and q. We say p or q which means at least one of p and q is true. p q p q True True True example. The sun is shinning or I am sick. False True True True False True False False False p q denotes the implication between p and q. We say p implies q which means that q is a logical consequence of p: example. If I put money in the vending machine then I get a drink. p q p q True True True True False False False True True False False True 11 / 36
20 Logical operators p q denotes the disjunction of p and q. We say p or q which means at least one of p and q is true. p q p q True True True example. The sun is shinning or I am sick. False True True True False True False False False p q denotes the implication between p and q. We say p implies q which means that q is a logical consequence of p: example. If I put money in the vending machine then I get a drink. p q p q True True True True False False False True True False False True 11 / 36
21 Logical operators If the sun is shinning and I am not sick, then I go for a hike in the mountain. p: The sun is shinning. q: I am sick. r: I go for a hike in the mountain. (p ( q)) r We can unambiguously omit some of the brackets because: (1) Binding priorities >, > (p ( q)) r p q r (p q) p q 12 / 36
22 Logical operators If the sun is shinning and I am not sick, then I go for a hike in the mountain. p: The sun is shinning. q: I am sick. r: I go for a hike in the mountain. (p ( q)) r We can unambiguously omit some of the brackets because: (1) Binding priorities >, > (p ( q)) r p q r (2) Right associativity of (p q) p q p q r p (q r) 12 / 36
23 Logical operators If the sun is shinning and I am not sick, then I go for a hike in the mountain. p: The sun is shinning. q: I am sick. r: I go for a hike in the mountain. (p ( q)) r We can unambiguously omit some of the brackets because: (1) Binding priorities >, > (p ( q)) r p q r (2) Right associativity of (p q) p q p q r p (q r) 12 / 36
24 She brought neither pen nor pencil. p: She brought a pen., q: She brought a pencil. p q Cancer will not be cured unless its cause is determined and a new drug for cancer is found. p: The cause of cancer is determined., q: A new drug of cancer is found., r: Cancer is cured. p q r 13 / 36
25 Quizz / Make sure that you fully understand the binding priorities by inserting as many brackets as possible. e.g. p q r means (p q) r since binds more tightly than (a) p q p q (b) p ( q p r) (c) Why p q r is problematic? 2/ Translate the following English sentences into propositions. (a) If the train arrives late and there are no taxis at the station, then John is late for his meeting. (b) The weather tomorrow is either rainy or cloudy. (c) No teacher. No students. No class. (d) Today, it will rain or shine, but not both. 14 / 36
26 Sequent Example 1.1 If the train arrives late and there are no taxis at the station, then John is late for his meeting. John is not late for his meeting. The train did arrive late. Therefore, there were taxis at the station. p: The train arrives late. q: There are taxis at the station. p q r r: John is late for his meeting. 15 / 36
27 Sequent Example 1.1 If the train arrives late and there are no taxis at the station, then John is late for his meeting. John is not late for his meeting. The train did arrive late. Therefore, there were taxis at the station. p: The train arrives late. q: There are taxis at the station. r: John is late for his meeting. p q r r 16 / 36
28 Sequent Example 1.1 If the train arrives late and there are no taxis at the station, then John is late for his meeting. John is not late for his meeting. The train did arrive late. Therefore, there were taxis at the station. p: The train arrives late. q: There are taxis at the station. r: John is late for his meeting. p q r r p 17 / 36
29 Example 1.1 Sequent If the train arrives late and there are no taxis at the station, then John is late for his meeting. John is not late for his meeting.the train did arrive late. Therefore, there were taxis at the station. p: The train arrives late. q: There are taxis at the station. r: John is late for his meeting. From p q r r p infer q suppose we have propositions p q r, r, p that we call the premises we apply proof rules, that we call natural deduction rules, to premises and propositions inferred from premises eventually, we obtain proposition q that we call the conclusion 18 / 36
30 Example 1.1 Sequent If the train arrives late and there are no taxis at the station, then John is late for his meeting. John is not late for his meeting.the train did arrive late. Therefore, there were taxis at the station. p: The train arrives late. q: There are taxis at the station. r: John is late for his meeting. From p q r r p infer q suppose we have propositions p q r, r, p that we call the premises we apply proof rules, that we call natural deduction rules, to premises and propositions inferred from premises eventually, we obtain proposition q that we call the conclusion 18 / 36
31 Sequent p q r, r, p }{{} premises q }{{} conclusion φ 1, φ 2,..., φ n }{{} premises ψ }{{} conclusion The above expression is called sequent If a proof is found then the sequent is valid we manage to infer the conclusion ψ by applying natural deduction rules on propositions (premises and propositions inferred from premises) 19 / 36
32 Sequent p q r, r, p }{{} premises q }{{} conclusion φ 1, φ 2,..., φ n }{{} premises ψ }{{} conclusion The above expression is called sequent If a proof is found then the sequent is valid we manage to infer the conclusion ψ by applying natural deduction rules on propositions (premises and propositions inferred from premises) What are the natural deduction rules? How to choose them? 19 / 36
33 Sequent p q r, r, p }{{} premises q }{{} conclusion φ 1, φ 2,..., φ n }{{} premises ψ }{{} conclusion The above expression is called sequent If a proof is found then the sequent is valid we manage to infer the conclusion ψ by applying natural deduction rules on propositions (premises and propositions inferred from premises) What are the natural deduction rules? How to choose them? 19 / 36
34 Rules for conjunction: (1) and-introduction If we have φ and ψ, we can conclude φ ψ Note that φ and ψ can be any proposition φ ψ φ ψ i Example p: The sun is shining., q: I am not sick. p: They met yesterday, q r: They took a cup of coffee or went for a walk p q p q p q r p (q r) i i 20 / 36
35 Rules for conjunction: (1) and-introduction If we have φ and ψ, we can conclude φ ψ Note that φ and ψ can be any proposition φ ψ φ ψ i Example p: The sun is shining., q: I am not sick. p: They met yesterday, q r: They took a cup of coffee or went for a walk p q p q p q r p (q r) i i 20 / 36
36 Rules for conjunction: (2) and-elimination If we have φ ψ then we can conclude φ If we have φ ψ then we can conclude ψ Example p: The sun is shining., q: I am not sick. φ ψ φ φ ψ ψ p q p p q q e 1 e 2 e 1 e 2 21 / 36
37 Rules for conjunction: (2) and-elimination If we have φ ψ then we can conclude φ If we have φ ψ then we can conclude ψ Example p: The sun is shining., q: I am not sick. φ ψ φ φ ψ ψ p q p p q q e 1 e 2 e 1 e 2 pattern matching: φ ψ φ e 1 φ ψ ψ e 2 21 / 36
38 Rules for conjunction: (2) and-elimination If we have φ ψ then we can conclude φ If we have φ ψ then we can conclude ψ Example p: The sun is shining., q: I am not sick. φ ψ φ φ ψ ψ p q p p q q e 1 e 2 e 1 e 2 pattern matching: φ ψ φ e 1 φ ψ ψ e 2 21 / 36
39 Rules for conjunction: Example We prove that p q, r q r is valid (1) Write down the premises, leave a gap, and then write the conclusion 1. p q premise 2. r premise q r 22 / 36
40 Rules for conjunction: Example We prove that p q, r q r is valid (1) Write down the premises, leave a gap, and then write the conclusion (2) Apply suitable natural deduction rules to fill the gap, in our example: 1. p q premise 2. r premise q r 23 / 36
41 Rules for conjunction: Example We prove that p q, r q r is valid (1) Write down the premises, leave a gap, and then the conclusion (2) Apply suitable natural deduction rules to fill the gap, in our example: We apply e 2 to the first premise, which gives us q Then, we apply i to q and the second premise, which gives us q r (pay attention to the order 3, 2) 1. p q premise 2. r premise 3. q e q r Recall: φ ψ φ ψ i φ ψ φ e 1 φ ψ ψ e 2 24 / 36
42 Rules for conjunction: Example We prove that p q, r q r is valid (1) Write down the premises, leave a gap, and then the conclusion (2) Apply suitable natural deduction rules to fill the gap, in our example: We apply e 2 to the first premise, which gives us q Then, we apply i to q and the second premise, which gives us q r (pay attention to the order 3, 2) 1. p q premise 2. r premise 3. q e q r i 3, 2 Recall: φ ψ φ ψ i φ ψ φ e 1 φ ψ ψ e 2 25 / 36
43 Rules for conjunction: Example We prove that p q, r q r is valid (1) Write down the premises, leave a gap, and then the conclusion (2) Apply suitable natural deduction rules to fill the gap, in our example: We apply e 2 to the first premise, which gives us q Then, we apply i to q and the second premise, which gives us q r (pay attention to the order 3, 2) Ja`skowski-style proof 1. p q premise 2. r premise 3. q e q r i 3, 2 Gentzen-style proof p q q e 2 q r r i Recall: φ ψ φ ψ i φ ψ φ e 1 φ ψ ψ e 2 26 / 36
44 Rules for conjunction: First example with Isabelle theory examples imports Main names begin end Open a new file and save it examples.thy Start a theory with the name examples Download theory names.thy (ghourabi.net/tp16.html) and save it in the same folder as examples.thy All the definitions and proofs are delimited by begin and end 27 / 36
45 Rules for conjunction: First example with Isabelle General structure of a (propositional logic) proof in Isar language lemma name: assumes assm 1 and and assm n shows goal proof -... [Steps of the proof]... qed A name is given to lemma so that, once proved, it can be used to prove other lemmas assm 1 assm n are premises goal is the conclusion The above lemma defines the following sequent: assm 1,, assm n goal 28 / 36
46 Rules for conjunction: First example with Isabelle We prove that p q, r q r is valid lemma example1: assumes p q and r shows q r proof qed [Steps of the proof] try: thm and introduction thm and elimination1 thm and elimination2 Can you guess the natural deduction rules? 29 / 36
47 Rules for conjunction: First example with Isabelle We prove that p q, r q r is valid lemma example1: assumes 1: p q and 2: r shows q r proof - from 1 have 3: q by (rule and elimination2) from 3 and 2 show q r by (rule and introduction) qed General scheme of an intermediate step of the proof from 1 have 3: q by (rule and elimination2) General scheme of the final step of the proof (no goal is left) from 3 and 2 show q r by (rule and introduction) 30 / 36
48 Rules for conjunction: First example with Isabelle We prove that p q, r q r is valid lemma example1: assumes 1: p q and 2: r shows q r proof - from 1 have 3: q by (rule and elimination2) from 3 and 2 show q r by (rule and introduction) qed General scheme of an intermediate step of the proof from 1 have 3: q by (rule and elimination2) General scheme of the final step of the proof (no goal is left) from 3 and 2 show q r by (rule and introduction) 30 / 36
49 Rules for conjunction: Second example with Isabelle Prove that p q q p is valid (1) on paper (2) with Isabelle 31 / 36
50 Rules for double negation: (3) notnot elimination It is not true that it is not raining. It is raining. 32 / 36
51 Rules for double negation: (3) notnot elimination It is not true that it is not raining. It is raining. φ φ e 32 / 36
52 Rules for double negation: (3) notnot elimination It is not true that it is not raining. It is raining. φ φ e 32 / 36
53 Rules for double negation: (4) notnot elimination It is not true that it is not raining. It is raining. φ φ i 33 / 36
54 Rules for double negation: Example Prove that p, (q r) p r 1. p premise 2. (q r) premise p r 34 / 36
55 Rules for double negation: Example Prove that p, (q r) p r 1. p premise 2. (q r) premise 3. p i 1 4. q r e 2 p r 35 / 36
56 Rules for double negation: Example Prove that p, (q r) p r 1. p premise 2. (q r) premise 3. p i 1 4. q r e 2 5. r e 2 6. p r i 3, 5 Remember: φ ψ ψ φ ψ φ ψ e 2 i Try the proof in Isabelle! 36 / 36
(p == train arrives late) (q == there are taxis) (r == If p and not q, then r. Not r. p. Therefore, q. Propositional Logic
Propositional Logic The aim of logic in computer science is to develop languages to model the situations we encounter as computer science professionals Want to do that in such a way that we can reason
More informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More information1 Propositional logic
1 Propositional logic The aim of logic in computer science is to develop languages to model the situations we encounter as computer science professionals, in such a way that we can reason about them formally.
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More information03 Propositional Logic II
Martin Henz February 12, 2014 Generated on Wednesday 12 th February, 2014, 09:49 1 Review: Syntax and Semantics of Propositional Logic 2 3 Propositional Atoms and Propositions Semantics of Formulas Validity,
More informationIntroduction to Theoretical Computer Science
Introduction to Theoretical Computer Science Zdeněk Sawa Department of Computer Science, FEI, Technical University of Ostrava 17. listopadu 15, Ostrava-Poruba 708 33 Czech republic February 11, 2018 Z.
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 informationPSU MATH RELAYS LOGIC & SET THEORY 2017
PSU MATH RELAYS LOGIC & SET THEORY 2017 MULTIPLE CHOICE. There are 40 questions. Select the letter of the most appropriate answer and SHADE in the corresponding region of the answer sheet. If the correct
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationA. Incorrect! This inequality is a disjunction and has a solution set shaded outside the boundary points.
Problem Solving Drill 11: Absolute Value Inequalities Question No. 1 of 10 Question 1. Which inequality has the solution set shown in the graph? Question #01 (A) x + 6 > 1 (B) x + 6 < 1 (C) x + 6 1 (D)
More informationCS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)
CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of
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 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 informationLogic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside.
You are a mathematician if 1.1 Overview you say to a car dealer, I ll take the red car or the blue one, but then you feel the need to add, but not both. --- 1. Logic and Mathematical Notation (not in the
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #2: Propositional Logic Based on materials developed by Dr. Adam Lee Today s Topic: Propositional
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 informationPropositional logic. Programming and Modal Logic
Propositional logic Programming and Modal Logic 2006-2007 4 Contents Syntax of propositional logic Semantics of propositional logic Semantic entailment Natural deduction proof system Soundness and completeness
More informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
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 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 informationChapter 5: Section 5-1 Mathematical Logic
Chapter 5: Section 5-1 Mathematical Logic D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 5: Section 5-1 Mathematical Logic 1 / 29 Mathematical Logic
More informationToday s Topic: Propositional Logic
Today s Topic: Propositional Logic What is a proposition? Logical connectives and truth tables Translating between English and propositional logic Logic is the basis of all mathematical and analytical
More informationA Quick Lesson on Negation
A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which
More informationDISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
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 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 informationPart Two: The Basic Components of the SOFL Specification Language
Part Two: The Basic Components of the SOFL Specification Language SOFL logic Module Condition Data Flow Diagrams Process specification Function definition and specification Process decomposition Other
More informationPropositional Logic. CS 3234: Logic and Formal Systems. Martin Henz and Aquinas Hobor. August 26, Generated on Tuesday 31 August, 2010, 16:54
Propositional Logic CS 3234: Logic and Formal Systems Martin Henz and Aquinas Hobor August 26, 2010 Generated on Tuesday 31 August, 2010, 16:54 1 Motivation In traditional logic, terms represent sets,
More informationPropositional logic. Programming and Modal Logic
Propositional logic Programming and Modal Logic 2006-2007 4 Contents Syntax of propositional logic Semantics of propositional logic Semantic entailment Natural deduction proof system Soundness and completeness
More informationSE 212: Logic and Computation. se212 Nancy Day
E 212, Fall 2018, University of Waterloo, Module 2, Page 1 SE 212: Logic and Computation Module 2: Propositional Logic http://www.student.cs.uwaterloo.ca/ se212 se212@uwaterloo.ca Nancy Day E 212, Fall
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
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 informationFORMAL PROOFS DONU ARAPURA
FORMAL PROOFS DONU ARAPURA This is a supplement for M385 on formal proofs in propositional logic. Rather than following the presentation of Rubin, I want to use a slightly different set of rules which
More informationWhat is Logic? Introduction to Logic. Simple Statements. Which one is statement?
What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo
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 informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
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 informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationLogical Structures in Natural Language: Propositional Logic II (Truth Tables and Reasoning
Logical Structures in Natural Language: Propositional Logic II (Truth Tables and Reasoning Raffaella Bernardi Università degli Studi di Trento e-mail: bernardi@disi.unitn.it Contents 1 What we have said
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 informationPropositions and Proofs
Chapter 2 Propositions and Proofs The goal of this chapter is to develop the two principal notions of logic, namely propositions and proofs There is no universal agreement about the proper foundations
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 informationCSE 20: Discrete Mathematics
Spring 2018 Last Time Welcome / Introduction to Propositional Logic Card Puzzle / Bar Puzzle Same Problem Same Logic Same Answer Logic is a science of the necessary laws of thought (Kant, 1785) Logic allow
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 informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationMathematics for linguists
Mathematics for linguists WS 2009/2010 University of Tübingen December 8, 2009 Gerhard Jäger Mathematics for linguists p. 1 Sentences and statements (1) You again! (2) Has the lecture already started?
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 informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
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 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 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 informationCS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration
Lecture 4 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square dministration Homework assignment 1 is out Due next week on Wednesday, September 17 Problems: LISP programming a PL
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 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 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 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 informationSymbolic Logic. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February 5 6,
Symbolic Logic Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February 5 6, 20182018 Alice E. Fischer Symbolic Logic... 1/19 1 2 3 Alice E. Fischer Symbolic Logic... 2/19 Symbolic Logic
More informationPropositional Logic George Belic
1 Symbols and Translation (Ch 6.1) Our aim for the rest of the course is to study valid (deductive) arguments in symbolic systems. In this section, (Ch. 6-7) we look at the symbolic system of propositional
More informationChapter 4, Logic using Propositional Calculus Handout
ECS 20 Chapter 4, Logic using Propositional Calculus Handout 0. Introduction to Discrete Mathematics. 0.1. Discrete = Individually separate and distinct as opposed to continuous and capable of infinitesimal
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 information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationCS 512, Spring 2016, Handout 02 Natural Deduction, and Examples of Natural Deduction, in Propositional Logic
CS 512, Spring 2016, Handout 02 Natural Deduction, and Examples of Natural Deduction, in Propositional Logic Assaf Kfoury January 19, 2017 Assaf Kfoury, CS 512, Spring 2017, Handout 02 page 1 of 41 from
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
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 Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More information1.1 Language and Logic
c Oksana Shatalov, Fall 2017 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 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 informationIntroduction to Intuitionistic Logic
Introduction to Intuitionistic Logic August 31, 2016 We deal exclusively with propositional intuitionistic logic. The language is defined as follows. φ := p φ ψ φ ψ φ ψ φ := φ and φ ψ := (φ ψ) (ψ φ). A
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 informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationDiscrete Mathematics
Discrete Mathematics Discrete mathematics is devoted to the study of discrete or distinct unconnected objects. Classical mathematics deals with functions on real numbers. Real numbers form a continuous
More information3 Propositional Logic
3 Propositional Logic 3.1 Syntax 3.2 Semantics 3.3 Equivalence and Normal Forms 3.4 Proof Procedures 3.5 Properties Propositional Logic (25th October 2007) 1 3.1 Syntax Definition 3.0 An alphabet Σ consists
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 informationPredicate Logic & Quantification
Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In
More informationSec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional
Section 1.1 Sec$on Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional ruth ables 2 Proposi$ons A proposition is a declarative
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 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 informationUnit 1 Logic Unit Math 114
Unit 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Deductive Reasoning: The application of a general statement to a specific instance. Deductive reasoning goes from general to specific
More informationa. ~p : if p is T, then ~p is F, and vice versa
Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.
More informationARTIFICIAL INTELLIGENCE
ARTIFICIAL INTELLIGENCE LECTURE # 03 Artificial Intelligence 2012 Lecture 03 Delivered By Zahid Iqbal 1 Review of Last Lecture Artificial Intelligence 2012 Lecture 03 Delivered By Zahid Iqbal 2 Today s
More informationInference in Propositional Logic
Inference in Propositional Logic Deepak Kumar November 2017 Propositional Logic A language for symbolic reasoning Proposition a statement that is either True or False. E.g. Bryn Mawr College is located
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 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 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 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 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 informationUnit 1 Logic Unit Math 114
Unit 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Deductive Reasoning: The application of a general statement to a specific instance. Deductive reasoning goes from general to specific
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 informationLecture Notes on Inductive Definitions
Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 August 28, 2003 These supplementary notes review the notion of an inductive definition and give
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 informationDiscrete Structures of Computer Science Propositional Logic III Rules of Inference
Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic
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 informationChapter 1 Logic Unit Math 114
Chapter 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Statements Definition: A statement is a group of words or symbols that can be classified as true or false. Examples of statements
More informationLogical Representations. LING 7800/CSCI 7000 Martha Palmer 9/30/2014
Logical Representations LING 7800/CSCI 7000 Martha Palmer 9/30/2014 1 The Semantic Wall Physical Symbol System World +BLOCKA+ +BLOCKB+ +BLOCKC+ P 1 :(IS_ON +BLOCKA+ +BLOCKB+) P 2 :((IS_RED +BLOCKA+) Truth
More informationLogic for Computer Science - Week 5 Natural Deduction
Logic for Computer Science - Week 5 Natural Deduction Ștefan Ciobâcă November 30, 2017 1 An Alternative View of Implication and Double Implication So far, we have understood as a shorthand of However,
More informationINTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims
Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of
More information