A Default Logic Approach to the Derivation of Natural Language Presuppositions

Total Page:16

File Type:pdf, Size:1020Kb

A Default Logic Approach to the Derivation of Natural Language Presuppositions A Default Logic Approach to the Derivation of Natural Language Presuppositions By Robert Ernest Mercer B. Sc., The University of Alberta, 1972 M. Sc., The University of Alberta, 1977 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY in THE FACULTY OF GRADUATE STUDIES Department of Computer Science We accept this thesis as conforming to the required standard THE UNIVERSITY OF BRITISH COLUMBIA October 1987 © Robert E. Mercer, 1987 In presenting this thesis in partial fulfilment of the requirements for an advanced degree at the University of British Columbia, I agree that the Library shall make it freely available for reference and study. I further agree that permission for extensive copying of this thesis for scholarly purposes may be granted by the head of my department or by his or her representatives. It is understood that copying or publication of this thesis for financial gain shall not be allowed without my written permission. Department of c^*0^^l*^ ew The University of British Columbia 1956 Main Mall Vancouver, Canada V6T 1Y3 Date /f <0C&le^ /f?1- DE-6(3/81) Abstract A hearer's interpretation of the meaning of an utterance consists of more than what is con• veyed by just the sentence itself. Other parts of the meaning are produced as inferences from three knowledge sources: the sentence itself, knowledge about the world, and knowledge about language use. One inference of this type is the natural language presupposition. This category of inference is distinguished by a number of features: the inferences are generated only, but not necessarily, if certain lexical or syntactic environments are present in the uttered sentence; normal interpretations of these presuppositional environments in the scope of a negation in a simple sentence produce the same inferences as the unnegated environment; and the inference can be cancelled by information in the conversational context. We propose a method for deriving presuppositions of natural language sentences that has its foundations in an inference-based concept of meaning. Whereas standard (monotonic) forms of reasoning are able to capture portions of a sentence's meaning, such as its entailments, non-monotonic forms of reasoning are required to derive its presuppositions. Gazdar's idea of presuppositions being consistent with the context, and the usual connection of presuppositions with lexical and syntactic environments motivates the use of Default Logic as the formal non• monotonic reasoning system. Not only does the default logic approach provide a natural means to represent presuppositions, but also a single (slightly restricted) default proof procedure is all that is required to generate the presuppositions. The naturalness and simplicity of this method contrasts with the traditional projection methods. Also available to the logical approach is the proper treatment of 'or' and 'if ... then ...' which is not available to any of the projection methods. The default logic approach is compared with four others, three projection methods and one non-projection method. As well as serving the function of demonstrating empirical and methodological difficulties with the other methods, the detailed investigation also provides the motivation for the topics discussed in connection with default logic approach. Some of the difficulties have been solved using the default logic method, while possible solutions for others have only been sketched. A brief discussion of a new method for providing corrective answers to questions is pre• sented. The novelty of this method is that the corrective answers are viewed as correcting presuppositions of the answer rather than of the question. ii Table of Contents Abstract ii Table of Contents iii List of Figures vii Acknowledgements viii 1 Introduction 1 1.1 Overview 1 1.2 Summary of Results 4 2 Relevant Language Issues 6 2.1 A Model of Communication 7 2.1.1 Situational Knowledge Sources 11 2.1.2 Background Knowledge Sources 11 2.1.3 Context 14 2.2 Non-standard Inferences 16 2.2.1 Grice's Conversational Theory 19 2.2.2 Implicatures - Conventional and Conversational 21 2.2.3 Reformulation of the Maxims 22 2.2.4 Summary 24 2.3 Presuppositions 25 2.3.1 Defining Presuppositions 26 2.3.2 Non-Presuppositions 30 2.3.3 Logical Presuppositions 32 iii 2.3.4 Semantic Presuppositions 33 2.3.4.1 Presuppositional Environments 34 2.3.4.2 Ambiguous Negation 38 2.3.4.3 Projection Problem for Presuppositions 39 2.3.5 Pragmatic Presuppositions 40 2.3.5.1 Speaker Beliefs 40 2.3.5.2 Kempson and Wilson 42 2.3.5.3 Projection Methods 45 3 A Default Logic Approach to Presuppositions 46 3.1 Logical and Representational Preliminaries 49 3.1.1 First-Order Representation 49 3.1.2 Importance of Inferencing 51 3.1.3 Representing Natural Language Negation 54 3.1.3.1 Ambiguity and Vagueness 56 3.1.3.2 Linguistic Tests for Ambiguity and Vagueness 58 3.1.3.3 Arguments Against the Ambiguity Hypothesis 60 3.1.4 Default Logic 66 3.2 Representing Presuppositions Using Default Rules 70 3.2.1 The General Scheme 72 3.2.2 Example 1 - Stop 74 3.2.3 Example 2 - Criterial and Noncriterial properties 76 3.2.4 Example 3 - Factive verbs 78 3.2.5 Example 4 - Focus 80 3.2.6 Correctly Interpreting the Inferences 81 3.2.7 Entailment vs Presupposition 83 3.2.8 Controlling the Application of the Default Rules 84 3.2.8.1 Constraining Default Rule Application in Case Analysis 84 3.2.8.2 Constraining Default Rule Application in General 86 3.3 Deriving Presuppositions in Complex Sentences 87 3.3.1 Example 1 - Or: No cancellation 91 3.3.2 Example 2 - Or: Intrasentential cancellation 93 iv 3.3.3 Example 3 - If... then No cancellation 97 3.3.4 Example 4 - If... then ...: Intrasentential cancellation 98 3.3.5 Example 5 - Possibly 100 3.4 A Definition of Presupposition 101 3.4.1 A Proof-Theoretic Definition of Presuppositions 101 3.4.2 A Model-Theoretic Definition of Presuppositions 102 Comparison of Various Approaches 105 4.1 Karttunen and Peters 107 4.1.1 Empirical Problems 109 4.1.1.1 Example 1 — Contradictory Presuppositions 110 4.1.1.2 Example 2 — Presuppositions cancelled by conversational im- plicatures Ill 4.1.1.3 Example 3 — Presuppositions cancelled by conversational im- plicatures 112 4.1.2 Methodological Problems 113 4.2 Gazdar 120 4.2.1 Empirical Counterexamples 124 4.2.1.1 Entailments Mislabelled as Presuppositions 125 4.2.1.2 Uncancelled Presuppositions 126 4.2.1.3 Non-Binary Features 128 4.2.2 Methodological Problems 130 4.2.3 Landman's Proposal 132 4.3 Gunji 133 4.3.1 Empirical Counterexamples 140 4.3.2 Methodological Problems 148 4.4 Soames 149 4.4.1 Empirical Problems 154 4.4.2 Methodological Problems 158 4.5 A Default Logic Approach 160 4.5.1 Methodological Similarities and Differences 160 4.5.2 Empirical Evidence 166 4.5.2.1 A Non-Binary Example 167 4.5.3 Sentential Adverbs 171 4.5.3.1 Too 172 4.5.3.2 Again 173 4.5.3.3 Default Logic Approach 174 4.5.4 Modified Phrases 176 4.5.5 Problems Requiring Further Analysis 180 4.5.5.1 Complex Indicative Conditionals 181 4.5.5.2 Multiple Extensions 183 4.6 Summary 185 5 Generating Corrective Answers 187 5.1 Questions and Answers 188 5.2 Description of the Two Methods 190 5.3 Differences between Px and PQ 193 6 Conclusion 195 6.1 Summary of Results 195 6.2 Future Work 197 References 199 vi List of Figures 2.1 A Model of Communication 8 3.1 Determining the Meaning of an Utterance 57 3.2 Two Types of Negation 61 3.3 Portion of H's ISA hierarchy 77 vii Acknowledgements To my supervisor, Richard Rosenberg, goes a great deal of gratitude for his guidance through the various stages of research and writing, especially since his job was complicated by doing much of it long distance, and, of course, for his having said the word presupposition at the right time. To the rest of my committee, Alan Mackworth, David Kirkpatrick, Paul Gilmore, and Michael Rochemont, I am grateful for their having taken the time to understand and criticize my research at various stages. I am especially indebted to Sarah Bell and Ray Reiter, both original committee members, whose special skills helped in the embryonic stages of my research. And I also thank the external examiner, C. Raymond Perrault, for his comments and criticisms. Thanks is also accorded to my fellow students, John Demco, Jay Glicksman, Jan Mulder, Alan Carter, and Jim Little for listening at various times to my rantings and ravings. But the most enduring gratitude is to David Etherington whose presence made my tenure as a student at UBC all the more worthwhile and whose influence will be felt long afterwards. Special thanks go to Nick Cercone of Simon Fraser University, whose faith in me was instru• mental in allowing me to get this far, and to Len Schubert of the University of Alberta, Bonnie Webber of the University of Pennsylvania, and Julia Hirschberg of A T & T Bell Laboratories who took the time to be interested in my work and make some crucial criticisms. Many others have made minor contributions to this thesis. They have been acknowledged elsewhere. And finally my most endearing gratitude goes to those who saw me at my worst; my wife, Nicole, and my children, Kelsey and Jonathan (whose births had been originally planned for after the thesis).
Recommended publications
  • Reasoning with Ambiguity
    Noname manuscript No. (will be inserted by the editor) Reasoning with Ambiguity Christian Wurm the date of receipt and acceptance should be inserted later Abstract We treat the problem of reasoning with ambiguous propositions. Even though ambiguity is obviously problematic for reasoning, it is no less ob- vious that ambiguous propositions entail other propositions (both ambiguous and unambiguous), and are entailed by other propositions. This article gives a formal analysis of the underlying mechanisms, both from an algebraic and a logical point of view. The main result can be summarized as follows: sound (and complete) reasoning with ambiguity requires a distinction between equivalence on the one and congruence on the other side: the fact that α entails β does not imply β can be substituted for α in all contexts preserving truth. With- out this distinction, we will always run into paradoxical results. We present the (cut-free) sequent calculus ALcf , which we conjecture implements sound and complete propositional reasoning with ambiguity, and provide it with a language-theoretic semantics, where letters represent unambiguous meanings and concatenation represents ambiguity. Keywords Ambiguity, reasoning, proof theory, algebra, Computational Linguistics Acknowledgements Thanks to Timm Lichte, Roland Eibers, Roussanka Loukanova and Gerhard Schurz for helpful discussions; also I want to thank two anonymous reviewers for their many excellent remarks! 1 Introduction This article gives an extensive treatment of reasoning with ambiguity, more precisely with ambiguous propositions. We approach the problem from an Universit¨atD¨usseldorf,Germany Universit¨atsstr.1 40225 D¨usseldorf Germany E-mail: [email protected] 2 Christian Wurm algebraic and a logical perspective and show some interesting surprising results on both ends, which lead up to some interesting philosophical questions, which we address in a preliminary fashion.
    [Show full text]
  • A Computer-Verified Monadic Functional Implementation of the Integral
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 411 (2010) 3386–3402 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs A computer-verified monadic functional implementation of the integral Russell O'Connor, Bas Spitters ∗ Radboud University Nijmegen, Netherlands article info a b s t r a c t Article history: We provide a computer-verified exact monadic functional implementation of the Riemann Received 10 September 2008 integral in type theory. Together with previous work by O'Connor, this may be seen as Received in revised form 13 January 2010 the beginning of the realization of Bishop's vision to use constructive mathematics as a Accepted 23 May 2010 programming language for exact analysis. Communicated by G.D. Plotkin ' 2010 Elsevier B.V. All rights reserved. Keywords: Type theory Functional programming Exact real analysis Monads 1. Introduction Integration is one of the fundamental techniques in numerical computation. However, its implementation using floating- point numbers requires continuous effort on the part of the user in order to ensure that the results are correct. This burden can be shifted away from the end-user by providing a library of exact analysis in which the computer handles the error estimates. For high assurance we use computer-verified proofs that the implementation is actually correct; see [21] for an overview. It has long been suggested that, by using constructive mathematics, exact analysis and provable correctness can be unified [7,8]. Constructive mathematics provides a high-level framework for specifying computations (Section 2.1).
    [Show full text]
  • Edinburgh Research Explorer
    Edinburgh Research Explorer Propositions as Types Citation for published version: Wadler, P 2015, 'Propositions as Types', Communications of the ACM, vol. 58, no. 12, pp. 75-84. https://doi.org/10.1145/2699407 Digital Object Identifier (DOI): 10.1145/2699407 Link: Link to publication record in Edinburgh Research Explorer Document Version: Peer reviewed version Published In: Communications of the ACM General rights Copyright for the publications made accessible via the Edinburgh Research Explorer is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The University of Edinburgh has made every reasonable effort to ensure that Edinburgh Research Explorer content complies with UK legislation. If you believe that the public display of this file breaches copyright please contact [email protected] providing details, and we will remove access to the work immediately and investigate your claim. Download date: 28. Sep. 2021 Propositions as Types ∗ Philip Wadler University of Edinburgh [email protected] 1. Introduction cluding Agda, Automath, Coq, Epigram, F#,F?, Haskell, LF, ML, Powerful insights arise from linking two fields of study previously NuPRL, Scala, Singularity, and Trellys. thought separate. Examples include Descartes’s coordinates, which Propositions as Types is a notion with mystery. Why should it links geometry to algebra, Planck’s Quantum Theory, which links be the case that intuitionistic natural deduction, as developed by particles to waves, and Shannon’s Information Theory, which links Gentzen in the 1930s, and simply-typed lambda calculus, as devel- thermodynamics to communication.
    [Show full text]
  • A Multi-Modal Analysis of Anaphora and Ellipsis
    University of Pennsylvania Working Papers in Linguistics Volume 5 Issue 2 Current Work in Linguistics Article 2 1998 A Multi-Modal Analysis of Anaphora and Ellipsis Gerhard Jaeger Follow this and additional works at: https://repository.upenn.edu/pwpl Recommended Citation Jaeger, Gerhard (1998) "A Multi-Modal Analysis of Anaphora and Ellipsis," University of Pennsylvania Working Papers in Linguistics: Vol. 5 : Iss. 2 , Article 2. Available at: https://repository.upenn.edu/pwpl/vol5/iss2/2 This paper is posted at ScholarlyCommons. https://repository.upenn.edu/pwpl/vol5/iss2/2 For more information, please contact [email protected]. A Multi-Modal Analysis of Anaphora and Ellipsis This working paper is available in University of Pennsylvania Working Papers in Linguistics: https://repository.upenn.edu/pwpl/vol5/iss2/2 A Multi-Modal Analysis of Anaphora and Ellipsis Gerhard J¨ager 1. Introduction The aim of the present paper is to outline a unified account of anaphora and ellipsis phenomena within the framework of Type Logical Categorial Gram- mar.1 There is at least one conceptual and one empirical reason to pursue such a goal. Firstly, both phenomena are characterized by the fact that they re-use semantic resources that are also used elsewhere. This issue is discussed in detail in section 2. Secondly, they show a striking similarity in displaying the characteristic ambiguity between strict and sloppy readings. This supports the assumption that in fact the same mechanisms are at work in both cases. (1) a. John washed his car, and Bill did, too. b. John washed his car, and Bill waxed it.
    [Show full text]
  • Topics in Philosophical Logic
    Topics in Philosophical Logic The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Litland, Jon. 2012. Topics in Philosophical Logic. Doctoral dissertation, Harvard University. Citable link http://nrs.harvard.edu/urn-3:HUL.InstRepos:9527318 Terms of Use This article was downloaded from Harvard University’s DASH repository, and is made available under the terms and conditions applicable to Other Posted Material, as set forth at http:// nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of- use#LAA © Jon Litland All rights reserved. Warren Goldfarb Jon Litland Topics in Philosophical Logic Abstract In “Proof-Theoretic Justification of Logic”, building on work by Dummett and Prawitz, I show how to construct use-based meaning-theories for the logical constants. The assertability-conditional meaning-theory takes the meaning of the logical constants to be given by their introduction rules; the consequence-conditional meaning-theory takes the meaning of the log- ical constants to be given by their elimination rules. I then consider the question: given a set of introduction (elimination) rules , what are the R strongest elimination (introduction) rules that are validated by an assertabil- ity (consequence) conditional meaning-theory based on ? I prove that the R intuitionistic introduction (elimination) rules are the strongest rules that are validated by the intuitionistic elimination (introduction) rules. I then prove that intuitionistic logic is the strongest logic that can be given either an assertability-conditional or consequence-conditional meaning-theory. In “Grounding Grounding” I discuss the notion of grounding. My discus- sion revolves around the problem of iterated grounding-claims.
    [Show full text]
  • Negation” Impedes Argumentation: the Case of Dawn
    When “Negation” Impedes Argumentation: The Case of Dawn Morgan Sellers Arizona State University Abstract: This study investigates one student’s meanings for negations of various mathematical statements. The student, from a Transition-to-Proof course, participated in two clinical interviews in which she was asked to negate statements with one quantifier or logical connective. Then, the student was asked to negate statements with a combination of quantifiers and logical connectives. Lastly, the student was presented with several complex mathematical statements from Calculus and was asked to determine if these statements were true or false on a case-by- case basis using a series of graphs. The results reveal that the student used the same rule for negation in both simple and complex mathematical statements when she was asked to negate each statement. However, when the student was asked to determine if statements were true or false, she relied on her meaning for the mathematical statement and formed a mathematically convincing argument. Key words: Negation, Argumentation, Complex Mathematical Statements, Calculus, Transition- to-Proof Many studies have noted that students often interpret logical connectives (such as and and or) and quantifiers (such as for all and there exists) in mathematical statements in ways contrary to mathematical convention (Case, 2015; Dawkins & Cook, 2017; Dawkins & Roh, 2016; Dubinsky & Yiparki, 2000; Epp,1999, 2003; Selden & Selden, 1995; Shipman, 2013, Tall, 1990). Recently, researchers have also called for attention to the logical structures found within Calculus theorems and definitions (Case, 2015; Sellers, Roh, & David, 2017) because students must reason with these logical components in order to verify or refute mathematical claims.
    [Show full text]
  • Logical Connectives in Natural Languages
    Logical connectives in natural languages Leo´ Picat Introduction Natural languages all have common points. These shared features define and constrain them. A key property of all natural languages is their learnability. As long as children are exposed to it, they can learn any spoken or signed language. This process takes place in environments in which children are not exposed to the full diversity of their mother tongue: it is with only few evidences that they master the ability to express themselves through language. As children are not exposed to negative evidences, learning a language would not be possible if con- straints were not present to limit the space of possible languages. Input-based theories predict that these constraints result from general cognition mechanisms. Knowledge-based theories predict that they are language specific and are part of a Universal Grammar [1]. Which approach is the right one is still a matter of debate and the implementation of these constraints within our brain is still to be determined. Yet, one can get a taste of them as they surface in linguistic universals. Universals have been formulated for most domains of linguistics. The first person to open the way was Greenberg [2] who described 50 statements about syntax and morphology across languages. In the phono- logical domain, all languages have stops for example [3]. Though, few universals are this absolute; most of them are more statistical truth or take the form of conditional statements. Universals have also been defined for semantics with more or less success [4]. Some of them shed light on non-linguistic abilities.
    [Show full text]
  • Part 2 Module 1 Logic: Statements, Negations, Quantifiers, Truth Tables
    PART 2 MODULE 1 LOGIC: STATEMENTS, NEGATIONS, QUANTIFIERS, TRUTH TABLES STATEMENTS A statement is a declarative sentence having truth value. Examples of statements: Today is Saturday. Today I have math class. 1 + 1 = 2 3 < 1 What's your sign? Some cats have fleas. All lawyers are dishonest. Today I have math class and today is Saturday. 1 + 1 = 2 or 3 < 1 For each of the sentences listed above (except the one that is stricken out) you should be able to determine its truth value (that is, you should be able to decide whether the statement is TRUE or FALSE). Questions and commands are not statements. SYMBOLS FOR STATEMENTS It is conventional to use lower case letters such as p, q, r, s to represent logic statements. Referring to the statements listed above, let p: Today is Saturday. q: Today I have math class. r: 1 + 1 = 2 s: 3 < 1 u: Some cats have fleas. v: All lawyers are dishonest. Note: In our discussion of logic, when we encounter a subjective or value-laden term (an opinion) such as "dishonest," we will assume for the sake of the discussion that that term has been precisely defined. QUANTIFIED STATEMENTS The words "all" "some" and "none" are examples of quantifiers. A statement containing one or more of these words is a quantified statement. Note: the word "some" means "at least one." EXAMPLE 2.1.1 According to your everyday experience, decide whether each statement is true or false: 1. All dogs are poodles. 2. Some books have hard covers. 3.
    [Show full text]
  • Monads and E Ects
    Monads and Eects Nick Benton John Hughes and Eugenio Moggi Microsoft Research Chalmers Univ DISI Univ di Genova Genova Italy moggidisiunigeit Abstract A tension in language design has b een b etween simple se mantics on the one hand and rich p ossibilities for sideeects exception handling and so on on the other The intro duction of monads has made a large step towards reconciling these alternatives First prop osed by Moggi as a way of structuring semantic descriptions they were adopted by Wadler to structure Haskell programs and now oer a general tech nique for delimiting the scop e of eects thus reconciling referential trans parency and imp erative op erations within one programming language Monads have b een used to solve longstanding problems such as adding p ointers and assignment interlanguage working and exception handling to Haskell without compromising its purely functional semantics The course will intro duce monads eects and related notions and exemplify their applications in programming Haskell and in compilation MLj The course will present typ ed metalanguages for monads and related categorical notions and describ e how they can b e further rened by in tro ducing eects Research partially supp orted by MURST and ESPRIT WG APPSEM Monads and Computational Typ es Monads sometimes called triples have b een considered in Category Theory CT relatively late only in the late fties Monads and comonads the dual of monads are closely related to adjunctions probably the most p ervasive no tion in CT The connection b etween monads
    [Show full text]
  • Handout 5 – the Semantics of Predicate Logic LX 502 – Semantics I October 17, 2008
    Handout 5 – The Semantics of Predicate Logic LX 502 – Semantics I October 17, 2008 1. The Interpretation Function This handout is a continuation of the previous handout and deals exclusively with the semantics of Predicate Logic. When you feel comfortable with the syntax of Predicate Logic, I urge you to read these notes carefully. The business of semantics, as I have stated in class, is to determine the truth-conditions of a proposition and, in so doing, describe the models in which a proposition is true (and those in which it is false). Although we’ve extended our logical language, our goal remains the same. By adopting a more sophisticated logical language with a lexicon that includes elements below the sentence-level, we now need a more sophisticated semantics, one that derives the meaning of the proposition from the meaning of its constituent individuals, predicates, and variables. But the essentials are still the same. Propositions correspond to states of affairs in the outside world (Correspondence Theory of Truth). For example, the proposition in (1) is true if and only if it correctly describes a state of affairs in the outside world in which the object corresponding to the name Aristotle has the property of being a man. (1) MAN(a) Aristotle is a man The semantics of Predicate Logic does two things. It assigns a meaning to the individuals, predicates, and variables in the syntax. It also systematically determines the meaning of a proposition from the meaning of its constituent parts and the order in which those parts combine (Principle of Compositionality).
    [Show full text]
  • Statement Negation All Do
    9/11/2013 Chapter 3 Introduction to Logic 2012 Pearson Education, Inc. Slide 3-1-1 Chapter 3: Introduction to Logic 3.1 Statements and Quantifiers 3.2 Truth Tables and Equivalent Statements 3.3 The Conditional and Circuits 3.4 More on the Conditional 3.5 Analyzing Arguments with Euler Diagrams 3.6 Analyzing Arguments with Truth Tables 2012 Pearson Education, Inc. Slide 3-1-2 1 9/11/2013 Section 3-1 Statements and Quantifiers 2012 Pearson Education, Inc. Slide 3-1-3 Statements and Qualifiers • Statements • Negations • Symbols • Quantifiers • Sets of Numbers 2012 Pearson Education, Inc. Slide 3-1-4 2 9/11/2013 Statements A statement is defined as a declarative sentence that is either true or false, but not both simultaneously. 2012 Pearson Education, Inc. Slide 3-1-5 Compound Statements A compound statement may be formed by combining two or more statements. The statements making up the compound statement are called the component statements . Various connectives such as and , or , not , and if…then , can be used in forming compound statements. 2012 Pearson Education, Inc. Slide 3-1-6 3 9/11/2013 Example: Compound Statements Decide whether each statement is compound. a) If Amanda said it, then it must be true. b) The gun was made by Smith and Wesson. Solution a) This statement is compound. b) This is not compound since and is part of a manufacturer name and not a logical connective. 2012 Pearson Education, Inc. Slide 3-1-7 Negations The sentence “Max has a valuable card” is a statement; the negation of this statement is “Max does not have a valuable card.” The negation of a true statement is false and the negation of a false statement is true.
    [Show full text]
  • 9 Logical Connectives
    9 Logical Connectives Like its built-in programming language, Coq’s built-in logic is extremely small: universal quantification (forall) and implication ( ) are primitive, but all the other familiar logical connectives—conjunction, disjunction, nega- tion, existential quantification, even equality—can be defined! using just these and Inductive. 9.1 Conjunction The logical conjunction of propositions A and B is represented by the follow- ing inductively defined proposition. Inductive and (A B : Prop) : Prop := conj : A B (and A B). ev Note that, like! the definition! of , this definition is parameterized; however, in this case, the parameters are themselves propositions. The intuition behind this definition is simple: to construct evidence for and A B, we must provide evidence for A and evidence for B. More precisely: 1. conj e1 e2 can be taken as evidence for and A B if e1 is evidence for A and e2 is evidence for B; and 2. this is the only way to give evidence for and A B—that is, if someone gives us evidence for and A B, we know it must have the form conj e1 e2, where e1 is evidence for A and e2 is evidence for B. 9.1.1 EXERCISE [F]: What does the induction principle and_ind look like? Since we’ll be using conjunction a lot, let’s introduce a more familiar- looking infix notation for it. Notation "A ^ B" := (and A B) : type_scope. 9.2 Bi-implication (Iff) 69 (The type_scope annotation tells Coq that this notation will be appearing in propositions, not values.) Besides the elegance of building everything up from a tiny foundation, what’s nice about defining conjunction this way is that we can prove state- ments involving conjunction using the tactics that we already know.
    [Show full text]