Choosing Logical Connectives
|
|
- Gervase Simpson
- 6 years ago
- Views:
Transcription
1 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? Consider: For 2-line truth tables, L1 only has ONE connective (namely, ). But there are actually FOUR possible connectives that operate on single atomic statements: P C1 (%P) C2 (@P) C3 ( P) C4 (#P) T T T F F F T F T F In other words, we could have chosen to include a connective in our language L1 (call it # ), which is such that, when P is true, #P is false, and when P is false, #P is false. Why didn t we? But, it gets worse: For 4-line truth tables, which operate on 2 sentence letters, we have chosen to use only 4 connectives (namely,,,, and ), but it turns out that there are actually SIXTEEN possible 2-letter connectives: P Q C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 C12 C13 C14 C15 C16 And there are actually 256 possible connectives which operate on 3 letter-sentences (the number of possible connectives will be 2 raised to the 2 n power (i.e., 2 2^n ), where n is the number of atomic statements being operated on), but L1 contains zero of them. Indeed, there are an infinite number of possible logical connectives that we could have chosen to include in L1, but we chose only FIVE! When we ask, Are five connectives enough?, what we are really asking is, Is L1 expressively complete? That means: Expressively Complete: A formal language, L, is expressively complete iff any wff containing any truth-functional connective can be translated into a wff that is logically equivalent to it, but which contains only connectives that are part of L. 1
2 In other words, for any of the 20 connectives we just saw truth tables for, L1 should be able to express a symbolized statements that operates on P and Q in those ways, to deliver exactly those truth tables. If L1 CANNOT do that, then there are some statements that L1 simply cannot express and that is bad It would mean that L1 is incomplete. But, let s look at the 16 possible 2-letter operators again: P Q C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 C12 C13 C14 C15 C16 Are any of these 16 connectives familiar? Four of them should be. They are: C3 = C7 = C9 = C15 = Additionally, four of the connectives above are the contradictories of these four. For instance, compare C8 with C9. They are contradictory. That is, their truth values are the opposite on every line of the truth table. So, since C9 represents P Q, C8 represents (P Q). Take a look and try to find the contradictories of the other three connectives. C3 s contradictory is C14. C7 s contradictory is C10. And C15 s contradictory is C2. So, now we have: P Q C1 (P Q) P Q C4 C5 C6 P Q (P Q) P Q (P Q) C11 C12 C13 (P Q) P Q C16 Let s look at some of the others. Start with C5. What sort of formula involving P and Q would ONLY come out false when Q is true and P is false? That should look familiar. It s Q P of course! So, C5 represents the truth function of Q P, and therefore, it s contradictory, C12, represents (Q P). Now take a look at C13. It simply has the same truth function as P. And C11 is just Q. So, in turn, their contradictories (C4 and C6) are just P and Q. 2
3 P Q C1 (P Q) P Q P Q P Q P Q (P Q) P Q (P Q) Q (Q P) P (P Q) P Q C16 All that are left are C1 and C16. Notice that C1 is just a tautologous statement and C16 is just a self-contradictory statement. (That is C1 always comes out true, and C16 always comes out false). So, for C1, we need nothing more than P P, while for C16 we just need P P. We re done! P Q P P (P Q) P Q P Q P Q P Q (P Q) P Q (P Q) Q (Q P) P (P Q) P Q P P Conclusion: Assuming we could continue in this way, representing all 256 of the 3-letter operators, and the infinite number of 4-letter, 5-letter, etc. operators (and, the short story is, we COULD do this), it turns out, L1 is expressively complete. Think about that: With just 5 little operators, L1 is able to express an infinite number of English sentences! 2. Too Many Connectives?: Really, though, we could make do with LESS THAN five operators. One of the five in particular should stand out as unnecessary. Which one? The bi-conditional! In fact, when we defined the bi-conditional, we said that it was really just two conditionals. In other words: P Q (P Q) (Q P) So, the is really unnecessary. It can just be expressed using and, since the two statements above are logically equivalent. So, we could have chosen only 4 operators instead of 5. Are there any other unnecessary operators? Well, it turns out that can be expressed in terms of and, such that: P Q (P Q) 3
4 For instance, if I say, If Fluffy is a cat, then Fluffy is a mammal, this really means the same thing as, So, it must not be the case that Fluffy is a cat AND NOT a mammal. Note: If you question this, then draw up a truth table for (C M) and see that it is the same as the truth table for C M. So, we don t need either. L1 would still be expressively complete even if it just included, and. We could have chosen to express and as follows: P Q (P Q) P Q (P Q) (Q P) But, wait. The isn t necessary either! It s reducible to and, since: P Q ( P Q) For instance, if I say that Timmy is either five or six, this really just means that It must NOT be the case that Timmy is not five and not six. Note: Again, if you question this, then draw up a truth table for ( F S) and see that it is the same as the truth table for F S. So, we don t need either! We ve done away with all but TWO operators! That is, L1 would still be expressively complete if the only two operators were and. The Sheffer Stroke: But, it gets crazier. Henry Sheffer (in 1913) pointed out that a language could be expressively complete with just ONE logical connective. It s called The Sheffer Stroke. We represent it with a slash,, and its truth table corresponds to C2, above. So, it turns out that P Q is logically equivalent to (P Q) : P Q (P Q) P Q T T F F T F T T F T T T F F T T In other words, P Sheffer-Stroke Q (or P Q ) just means Not both P and Q. For instance, we might symbolize Albert and Bertha weren t both at the party as A B. 4
5 Note: Notice that, whereas we reduced all 5 logical connectives to 2 connectives, and, Sheffer reduces all 5 connectives to ONE connective simply by introducing a NEW connective that is logically equivalent to (P Q), which contains both and. Sheffer showed that we can reduce all 5 of the operators to the Sheffer Stroke: P P P P Q (P Q) (P Q) P Q (P P) (Q Q) P Q P (Q Q) P Q {[P (Q Q)] [Q (P P)]} {[P (Q Q)] [Q (P P)]} Duuuuude, whooaah.. Conclusion: So, if there are an infinite number of possible logical connectives, but every sentence of L1 can be expressed with only ONE connective, why did we choose EXACTLY FIVE connectives no more, no less? The answer is that, we want to strike a balance between efficiency and parsimony. A parsimonious system uses as few connectives as possible. But, TOO FEW connectives, and the system becomes too burdensome to be efficient. (To see this, just look at how crazy the simple claim P Q becomes if we re only using the Sheffer Stroke!) We can express sentences with simpler, more efficient symbolizations by accepting MORE connectives but if TOO MANY connectives, and the system is no longer very parsimonious. So, we have to strike a balance, and arbitrarily pick some number of connectives that is large enough to not result in sentences that are too crazy and complicated, but small enough so that we are not working with an overly-long list of connectives. Logicians typically settle on the 5 connectives we have been using, no more, no less. 5
Truth Table Definitions of Logical Connectives
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.
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 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 informationFormal Logic Lecture 11
Faculty of Philosophy Formal Logic Lecture 11 Peter Smith Peter Smith: Formal Logic, Lecture 11 1 Outline Where next? Introducing PL trees Branching trees Peter Smith: Formal Logic, Lecture 11 2 Where
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 informationTruth 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 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 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 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 information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
More informationGödel s Incompleteness Theorem. Overview. Computability and Logic
Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,
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 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 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 informationPropositional Calculus. Problems. Propositional Calculus 3&4. 1&2 Propositional Calculus. Johnson will leave the cabinet, and we ll lose the election.
1&2 Propositional Calculus Propositional Calculus Problems Jim Woodcock University of York October 2008 1. Let p be it s cold and let q be it s raining. Give a simple verbal sentence which describes each
More informationAn analogy from Calculus: limits
COMP 250 Fall 2018 35 - big O Nov. 30, 2018 We have seen several algorithms in the course, and we have loosely characterized their runtimes in terms of the size n of the input. We say that the algorithm
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 informationIntermediate Logic. Natural Deduction for TFL
Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The
More informationGÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem
GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS BEN CHAIKEN Abstract. This paper will discuss the completeness and incompleteness theorems of Kurt Gödel. These theorems have a profound impact on the philosophical
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 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 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 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 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 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 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 informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationChapter 4: Classical Propositional Semantics
Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical
More informationPHIL12A Section answers, 14 February 2011
PHIL12A Section answers, 14 February 2011 Julian Jonker 1 How much do you know? 1. You should understand why a truth table is constructed the way it is: why are the truth values listed in the order they
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 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 informationTHE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Predicates
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 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 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 informationLing 130 Notes: Syntax and Semantics of Propositional Logic
Ling 130 Notes: Syntax and Semantics of Propositional Logic Sophia A. Malamud January 21, 2011 1 Preliminaries. Goals: Motivate propositional logic syntax and inferencing. Feel comfortable manipulating
More informationIntroduction to Logic and Axiomatic Set Theory
Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some
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 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 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 informationGödel s Incompleteness Theorems
Seminar Report Gödel s Incompleteness Theorems Ahmet Aspir Mark Nardi 28.02.2018 Supervisor: Dr. Georg Moser Abstract Gödel s incompleteness theorems are very fundamental for mathematics and computational
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 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 informationThe Converse of Deducibility: C.I. Lewis and the Origin of Modern AAL/ALC Modal 2011 Logic 1 / 26
The Converse of Deducibility: C.I. Lewis and the Origin of Modern Modal Logic Edwin Mares Victoria University of Wellington AAL/ALC 2011 The Converse of Deducibility: C.I. Lewis and the Origin of Modern
More informationGödel s Incompleteness Theorem. Overview. Computability and Logic
Gödel s Incompleteness Theorem Overview Computability and Logic Recap Remember what we set out to do in this course: Trying to find a systematic method (algorithm, procedure) which we can use to decide,
More informationLogic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1
Logic One reason for studying logic is that we need a better notation than ordinary English for expressing relationships among various assertions or hypothetical states of affairs. A solid grounding in
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 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 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 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 informationMathmatics 239 solutions to Homework for Chapter 2
Mathmatics 239 solutions to Homework for Chapter 2 Old version of 8.5 My compact disc player has space for 5 CDs; there are five trays numbered 1 through 5 into which I load the CDs. I own 100 CDs. a)
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 informationa. Introduction to metatheory
a. Introduction to metatheory a.i. Disclaimer The two additional lectures are aimed at students who haven t studied Elements of Deductive Logic students who have are unlikely to find much, if anything,
More informationFirst Order Logic: Syntax and Semantics
irst Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Logic Recap You should already know the basics of irst Order Logic (OL) It s a prerequisite of this course!
More informationGeneralized Quantifiers Logical and Linguistic Aspects
Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun
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 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 informationLogic: Propositional Logic Truth Tables
Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
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 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 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 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 informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
More informationPHIL 422 Advanced Logic Inductive Proof
PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon
More informationThe trick is to multiply the numerator and denominator of the big fraction by the least common denominator of every little fraction.
Complex Fractions A complex fraction is an expression that features fractions within fractions. To simplify complex fractions, we only need to master one very simple method. Simplify 7 6 +3 8 4 3 4 The
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 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 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 informationCompleteness for FOL
Completeness for FOL Overview Adding Witnessing Constants The Henkin Theory The Elimination Theorem The Henkin Construction Lemma 12 This lemma assures us that our construction of M h works for the atomic
More informationIntroduction to Basic Proof Techniques Mathew A. Johnson
Introduction to Basic Proof Techniques Mathew A. Johnson Throughout this class, you will be asked to rigorously prove various mathematical statements. Since there is no prerequisite of a formal proof class,
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 informationExclusive Disjunction
Exclusive Disjunction Recall A statement is a declarative sentence that is either true or false, but not both. If we have a declarative sentence s, p: s is true, and q: s is false, can we rewrite s is
More informationLecture 7. Logic. Section1: Statement Logic.
Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement
More information1 Tautologies, contradictions and contingencies
DEDUCTION (I) TAUTOLOGIES, CONTRADICTIONS AND CONTINGENCIES & LOGICAL EQUIVALENCE AND LOGICAL CONSEQUENCE October 6, 2003 1 Tautologies, contradictions and contingencies Consider the truth table of the
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 Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationPropositions. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1
Propositions An interpretation is an assignment of values to all variables. A model is an interpretation that satisfies the constraints. Often we don t want to just find a model, but want to know what
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 informationPark School Mathematics Curriculum Book 9, Lesson 2: Introduction to Logarithms
Park School Mathematics Curriculum Book 9, Lesson : Introduction to Logarithms We re providing this lesson as a sample of the curriculum we use at the Park School of Baltimore in grades 9-11. If you d
More informationIntroduction to Metalogic
Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional
More informationDiscrete Structures Proofwriting Checklist
CS103 Winter 2019 Discrete Structures Proofwriting Checklist Cynthia Lee Keith Schwarz Now that we re transitioning to writing proofs about discrete structures like binary relations, functions, and graphs,
More informationCS1800: Strong Induction. Professor Kevin Gold
CS1800: Strong Induction Professor Kevin Gold Mini-Primer/Refresher on Unrelated Topic: Limits This is meant to be a problem about reasoning about quantifiers, with a little practice of other skills, too
More informationSection 2.3: Statements Containing Multiple Quantifiers
Section 2.3: Statements Containing Multiple Quantifiers In this section, we consider statements such as there is a person in this company who is in charge of all the paperwork where more than one quantifier
More informationProseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1
First Order (Predicate) Logic: Syntax and Natural Deduction 1 A Reminder of Our Plot I wish to provide some historical and intellectual context to the formal tools that logicians developed to study the
More informationTake the Anxiety Out of Word Problems
Take the Anxiety Out of Word Problems I find that students fear any problem that has words in it. This does not have to be the case. In this chapter, we will practice a strategy for approaching word problems
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 information1.2 The Role of Variables
1.2 The Role of Variables variables sentences come in several flavors true false conditional In this section, a name is given to mathematical sentences that are sometimes true, sometimes false they are
More informationSince the two-sided limits exist, so do all one-sided limits. In particular:
SECTION 3.6 IN-SECTION EXERCISES: EXERCISE 1. The Intermediate Value Theorem 1. There are many correct graphs possible. A few are shown below. Since f is continuous on [a, b] and π is between f(a) = 3
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 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 informationExtensions to the Logic of All x are y: Verbs, Relative Clauses, and Only
1/53 Extensions to the Logic of All x are y: Verbs, Relative Clauses, and Only Larry Moss Indiana University Nordic Logic School August 7-11, 2017 2/53 An example that we ll see a few times Consider the
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 informationCS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques
CS 30, Winter 2011 Morphology of Proof: An introduction to rigorous proof techniques 1 Methodology of Proof An example Deep down, all theorems are of the form If A then B, though they may be expressed
More information30. TRANSFORMING TOOL #1 (the Addition Property of Equality)
30 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
More informationGuide to Proofs on Sets
CS103 Winter 2019 Guide to Proofs on Sets Cynthia Lee Keith Schwarz I would argue that if you have a single guiding principle for how to mathematically reason about sets, it would be this one: All sets
More information9. TRANSFORMING TOOL #2 (the Multiplication Property of Equality)
9 TRANSFORMING TOOL # (the Multiplication Property of Equality) a second transforming tool THEOREM Multiplication Property of Equality In the previous section, we learned that adding/subtracting the same
More informationProperties of Sequences
Properties of Sequences Here is a FITB proof arguing that a sequence cannot converge to two different numbers. The basic idea is to argue that if we assume this can happen, we deduce that something contradictory
More informationMust... stay... strong!
Alex Goebel 620 Spring 2016 Paper Presentation of von Fintel & Gillies (2010) Synopsis Must... stay... strong! Von Fintel & Gillies (vf&g) argue against a weakened semantics of must and propose an alternative
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 information