DOCSLIB.ORG

Introduction to Logic Introduction I Introduction II Examples I Examples II Logical Connectives

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Logic Introduction I Introduction II Examples I Examples II Logical Connectives Introduction I Introduction to Logic Propositional calculus (or logic) is the study of the logical Slides by Christopher M. Bourke relationship between objects called propositions and forms the Instructor: Berthe Y. Choueiry basis of all mathematical reasoning and all automated reasoning. Definition Fall 2007 A proposition is a statement that is either true or false, but not both (we usually denote a proposition by letters; p, q, r, s, . .). Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.1-1.2 of Rosen [email protected] Introduction II Examples I Definition Example (Propositions) The value of a proposition is called its truth value; denoted by T or Today is Monday. 1 if it is true and F or 0 if it is false. I I The derivative of sin x is cos x. Opinions, interrogative and imperative sentences are not I Every even number has at least two factors. propositions. Truth table: Example (Not Propositions) p 0 I C++ is the best language. 1 I When is the pretest? I Do your homework. Examples II Logical Connectives Connectives are used to create a compound proposition from two Example (Propositions?) or more other propositions. I Negation (denoted ¬ or !) I 2 + 2 = 5 I And (denoted ∧) or Logical Conjunction I Every integer is divisible by 12. I Or (denoted ∨) or Logical Disjunction I Microsoft is an excellent company. I Exclusive Or (XOR, denoted ⊕) I Implication (denoted →) I Biconditional; “if and only if” (denoted ↔) Negation Logical And The logical connective And is true only if both of the propositions A proposition can be negated. This is also a proposition. We are true. It is also referred to as a conjunction. usually denote the negation of a proposition p by ¬p. Example (Logical Connective: And) Example (Negated Propositions) I It is raining and it is warm. I Today is not Monday. √ I (2 + 3 = 5) ∧ ( 2 < 2) I It is not the case that today is Monday. I Schr¨odinger’s cat is dead and Schr¨odinger’s cat is not dead. I It is not the case that the derivative of sin x is cos x. Truth table: Truth table: p q p ∧ q p ¬p 0 0 0 0 1 0 1 0 1 0 1 0 0 1 1 1 Logical Or Exclusive Or The logical disjunction (or logical or) is true if one or both of the The exclusive or of two propositions is true when exactly one of its propositions are true. propositions is true and the other one is false. Example (Logical Connective: Or) Example (Logical Connective: Exclusive Or) The circuit is either is on or off. I It is raining or it is the second day of lecture. I √ Let ab < 0, then either a < 0 or b < 0 but not both. I (2 + 2 = 5) ∨ ( 2 < 2) I 1 You may have cake or ice cream, but not both. I You may have cake or ice cream. I Truth table: Truth table: p q p ∧ q p ∨ q 0 0 0 0 p q p ⊕ q 0 1 0 1 0 0 0 1 0 0 1 0 1 1 1 1 1 1 1 0 1 1 1 0 1Can I have both? Implications I Implications II Definition The implication p → q can be equivalently read as Let p and q be propositions. The implication I if p then q p → q I p implies q if p, q is the proposition that is false when p is true and q is false and I true otherwise. I p only if q I q if p Here, p is called the “hypothesis” (or “antecedent” or “premise”) I q when p and q is called the “conclusion” or “consequence”. I q whenever p Truth table: p q p → q I p is a sufficient condition for q (p is sufficient for q) 0 0 1 I q is a necessary condition for p (q is necessary for p) 0 1 1 I q follows from p 1 0 0 1 1 1 Examples Exercise Which of the following implications is true? Example I If −1 is a positive number, then 2 + 2 = 5. true: the hypothesis is obviously false, thus no matter what I If you buy your air ticket in advance, it is cheaper. the conclusion, the implication holds. If x is a real number, then x2 ≥ 0. I I If −1 is a positive number, then 2 + 2 = 4. I If it rains, the grass gets wet. true: for the same reason as above I If the sprinklers operate, the grass gets wet. I If sin x = 0 then x = 0. false: x can be any multiple of π; i.e. if we let x = 2π then I If 2 + 2 = 5 then all unicorns are pink. clearly sin x = 0, but x 6= 0. The implication “if sin x = 0 then x = kπ for some integer k” is true. Biconditional Examples Definition p ↔ q can be equivalently read as The biconditional p ↔ q I p if and only if q p is necessary and sufficient for q is the proposition that is true when p and q have the same truth I values. It is false otherwise. I if p then q, and conversely I p iff q (Note typo in textbook, page 9, line 3.) Note that it is equivalent to (p → q) ∧ (q → p) Truth table: Example 2 p q p → q q → p p ↔ q I x > 0 if and only if x is positive. 0 0 1 1 1 I The alarm goes off iff a burglar breaks in. 0 1 1 0 0 I You may have pudding if and only if you eat your meat. 1 0 0 1 0 1 1 1 1 1 Exercise Converse, Contrapositive, Inverse Which of the following biconditionals is true? 2 2 I x + y = 0 if and only if x = 0 and y = 0 Consider the proposition p → q: true: both implications hold. √ I 2 + 2 = 4 if and only if 2 < 2 I Its converse is the proposistion q → p. true: for the same reason above. I Its inverse is the proposistion ¬p → ¬q. 2 I x ≥ 0 if and only if x ≥ 0. I Its contrapositive is the proposistion ¬q → ¬p. false: The converse holds. That is, “if x ≥ 0 then x2 ≥ 0”. However, the implication is false; consider x = −1. Then the hypothesis is true, (−1)2 = 12 ≥ 0 but the conclusion fails. Truth Tables I Constructing Truth Tables Truth Tables are used to show the relationship between the truth values of individual propositions and the compound propositions Construct the Truth Table for the following compound proposition. based on them. ((p ∧ q) ∨ ¬q) p q p ∧ q p ∨ q p ⊕ q p → q p ↔ q 0 0 0 0 0 1 1 p q p ∧ q ¬q ((p ∧ q) ∨ ¬q) 0 1 0 1 1 1 0 0 0 0 1 1 1 0 0 1 1 0 0 0 1 0 0 0 1 1 1 1 0 1 1 1 0 0 1 1 Table: Truth Table for Logical Conjunction, Disjunction, Exclusive Or, 1 1 1 0 1 and Implication Precedence of Logical Operators Usefulness of Logic Just as in arithmetic, an ordering must be imposed on the use of logical operators in compound propositions. Logic is more precise than natural language: Of course, parentheses can be used to make operators disambiguous: I You may have cake or ice cream. Can I have both? ¬p ∨ q ∧ ¬r ≡ (¬p) ∨ q ∧ (¬r) I If you buy your air ticket in advance, it is cheaper. Are there or not cheap last-minute tickets? But to avoid using unnecessary parentheses, we define the following precedences: For this reason, logic is used for hardware and software specification. 1. (¬) Negation 2. (∧) Conjunction Given a set of logic statements, one can decide whether or not they are satisfiable (i.e., consistent), although this is a costly process... 3. (∨) Disjunction 4. (→) Implication 5. (↔) Biconditional Bitwise Operations Logic in Theorerical Computer Science Computers represent information as bits (binary digits). SAT A bit string is a sequence of bits, the length of the string is the number of bits in the string. Logical connectives can be applied to bit strings (of equal length). What is SAT? SAT is the problem of determining whether or not To do this, we simply apply the connective rules to each bit of the a sentence in propositional logic (PL) is satisfiable. Characterizing string: SAT as an NP-complete problem is at the foundation of Theoretical Computer Science. Example Defining SAT I Given: a PL sentence. 0110 1010 1101 Question: Determine whether it is satisfiable or not. 0101 0010 1111 I 0111 1010 1111 bitwise Or What is a PL sentence? What does satisfiable mean? 0100 0010 1101 bitwise And 0011 1000 0010 bitwise Xor A Boolean variable is a variable that can have value 0 or 1. Logic in Theorerical Computer Science Logic in Programming A sentence in PL Programming Example I Say you need to define a conditional statement as follows: I A sentence in PL is a conjunction of clauses “Increment x if all of the following conditions hold: x > 0, x < 10 I A clause is a disjunction of literals and x = 10.” I A literal is a term or its negation You may try: A term is a (Boolean) variable (or proposition) I if(0<x<10 OR x=10) x++; Example: (a ∨ b ∨ ¬c ∨ ¬d) ∧ (¬b ∨ c) ∧ (¬a ∨ c ∨ d) But is not valid in C++ or Java.
Load more

Recommended publications
  • Chapter 18 Negation
    Chapter 18 Negation Jong-Bok Kim Kyung Hee University, Seoul Each language has a way to express (sentential) negation that reverses the truth value of a certain sentence, but employs language-particular expressions and gram- matical strategies. There are four main types of negatives in expressing sentential negation: the adverbial negative, the morphological negative, the negative auxil- iary verb, and the preverbal negative. This chapter discusses HPSG analyses for these four strategies in marking sentential negation. 1 Modes of expressing negation There are four main types of negative markers in expressing negation in lan- guages: the morphological negative, the negative auxiliary verb, the adverbial negative, and the clitic-like preverbal negative (see Dahl 1979; Payne 1985; Zanut- tini 2001; Dryer 2005).1 Each of these types is illustrated in the following: (1) a. Ali elmalar-i ser-me-di-;. (Turkish) Ali apples-ACC like-NEG-PST-3SG ‘Ali didn’t like apples.’ b. sensayng-nim-i o-ci anh-usi-ess-ta. (Korean) teacher-HON-NOM come-CONN NEG-HON-PST-DECL ‘The teacher didn’t come.’ c. Dominique (n’) écrivait pas de lettre. (French) Dominique NEG wrote NEG of letter ‘Dominique did not write a letter.’ 1The term negator or negative marker is a cover term for any linguistic expression functioning as sentential negation. Jong-Bok Kim. 2021. Negation. In Stefan Müller, Anne Abeillé, Robert D. Borsley & Jean- Pierre Koenig (eds.), Head-Driven Phrase Structure Grammar: The handbook. Prepublished version. Berlin: Language Science Press. [Pre- liminary page numbering] Jong-Bok Kim d. Gianni non legge articoli di sintassi. (Italian) Gianni NEG reads articles of syntax ‘Gianni doesn’t read syntax articles.’ As shown in (1a), languages like Turkish have typical examples of morphological negatives where negation is expressed by an inflectional category realized on the verb by affixation.
    [Show full text]
  • UNIT-I Mathematical Logic Statements and Notations
    UNIT-I Mathematical Logic Statements and notations: A proposition or statement is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: “Paris is in France” (true), “London is in Denmark” (false), “2 < 4” (true), “4 = 7 (false)”. However the following are not propositions: “what is your name?” (this is a question), “do your homework” (this is a command), “this sentence is false” (neither true nor false), “x is an even number” (it depends on what x represents), “Socrates” (it is not even a sentence). The truth or falsehood of a proposition is called its truth value. Connectives: Connectives are used for making compound propositions. The main ones are the following (p and q represent given propositions): Name Represented Meaning Negation ¬p “not p” Conjunction p q “p and q” Disjunction p q “p or q (or both)” Exclusive Or p q “either p or q, but not both” Implication p ⊕ q “if p then q” Biconditional p q “p if and only if q” Truth Tables: Logical identity Logical identity is an operation on one logical value, typically the value of a proposition that produces a value of true if its operand is true and a value of false if its operand is false. The truth table for the logical identity operator is as follows: Logical Identity p p T T F F Logical negation Logical negation is an operation on one logical value, typically the value of a proposition that produces a value of true if its operand is false and a value of false if its operand is true.
    [Show full text]
  • Introduction to Logic
    IntroductionI Introduction to Logic Propositional calculus (or logic) is the study of the logical Christopher M. Bourke relationship between objects called propositions and forms the basis of all mathematical reasoning. Definition A proposition is a statement that is either true or false, but not both (we usually denote a proposition by letters; p, q, r, s, . .). Computer Science & Engineering 235 Introduction to Discrete Mathematics [email protected] IntroductionII ExamplesI Example (Propositions) Definition I 2 + 2 = 4 I The derivative of sin x is cos x. The value of a proposition is called its truth value; denoted by T or I 6 has 2 factors 1 if it is true and F or 0 if it is false. Opinions, interrogative and imperative sentences are not Example (Not Propositions) propositions. I C++ is the best language. I When is the pretest? I Do your homework. ExamplesII Logical Connectives Connectives are used to create a compound proposition from two Example (Propositions?) or more other propositions. I Negation (denoted or !) ¬ I 2 + 2 = 5 I And (denoted ) or Logical Conjunction ∧ I Every integer is divisible by 12. I Or (denoted ) or Logical Disjunction ∨ I Microsoft is an excellent company. I Exclusive Or (XOR, denoted ) ⊕ I Implication (denoted ) → I Biconditional; “if and only if” (denoted ) ↔ Negation Logical And A proposition can be negated. This is also a proposition. We usually denote the negation of a proposition p by p. ¬ The logical connective And is true only if both of the propositions are true. It is also referred to as a conjunction. Example (Negated Propositions) Example (Logical Connective: And) I Today is not Monday.
    [Show full text]
  • Automated Unbounded Verification of Stateful Cryptographic Protocols
    Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR Jannik Dreier Lucca Hirschi Sasaˇ Radomirovic´ Ralf Sasse Universite´ de Lorraine Department of School of Department of CNRS, Inria, LORIA Computer Science Science and Engineering Computer Science F-54000 Nancy ETH Zurich University of Dundee ETH Zurich France Switzerland UK Switzerland [email protected] [email protected] [email protected] [email protected] Abstract—Exclusive-or (XOR) operations are common in cryp- on widening the scope of automated protocol verification tographic protocols, in particular in RFID protocols and elec- by extending the class of properties that can be verified to tronic payment protocols. Although there are numerous appli- include, e.g., equivalence properties [19], [24], [27], [51], cations, due to the inherent complexity of faithful models of XOR, there is only limited tool support for the verification of [14], extending the adversary model with complex forms of cryptographic protocols using XOR. compromise [13], or extending the expressiveness of protocols, The TAMARIN prover is a state-of-the-art verification tool e.g., by allowing different sessions to update a global, mutable for cryptographic protocols in the symbolic model. In this state [6], [43]. paper, we improve the underlying theory and the tool to deal with an equational theory modeling XOR operations. The XOR Perhaps most significant is the support for user-specified theory can be freely combined with all equational theories equational theories allowing for the modeling of particular previously supported, including user-defined equational theories. cryptographic primitives [21], [37], [48], [24], [35].
    [Show full text]
  • Chapter 1 Logic and Set Theory
    Chapter 1 Logic and Set Theory To criticize mathematics for its abstraction is to miss the point entirely. Abstraction is what makes mathematics work. If you concentrate too closely on too limited an application of a mathematical idea, you rob the mathematician of his most important tools: analogy, generality, and simplicity. – Ian Stewart Does God play dice? The mathematics of chaos In mathematics, a proof is a demonstration that, assuming certain axioms, some statement is necessarily true. That is, a proof is a logical argument, not an empir- ical one. One must demonstrate that a proposition is true in all cases before it is considered a theorem of mathematics. An unproven proposition for which there is some sort of empirical evidence is known as a conjecture. Mathematical logic is the framework upon which rigorous proofs are built. It is the study of the principles and criteria of valid inference and demonstrations. Logicians have analyzed set theory in great details, formulating a collection of axioms that affords a broad enough and strong enough foundation to mathematical reasoning. The standard form of axiomatic set theory is denoted ZFC and it consists of the Zermelo-Fraenkel (ZF) axioms combined with the axiom of choice (C). Each of the axioms included in this theory expresses a property of sets that is widely accepted by mathematicians. It is unfortunately true that careless use of set theory can lead to contradictions. Avoiding such contradictions was one of the original motivations for the axiomatization of set theory. 1 2 CHAPTER 1. LOGIC AND SET THEORY A rigorous analysis of set theory belongs to the foundations of mathematics and mathematical logic.
    [Show full text]
  • A Symmetric Lambda-Calculus Corresponding to the Negation
    A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction Tatsuya Abe Software Technology and Artificial Intelligence Research Laboratory, Chiba Institute of Technology, 2-17-1 Tsudanuma, Narashino, Chiba, 275-0016, Japan [email protected] Daisuke Kimura Department of Information Science, Toho University, 2-2-1 Miyama, Funabashi, Chiba, 274-8510, Japan [email protected] Abstract Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive operators. That is, the duality of functions is not derived in the calculus but adopted as a principle of the calculus. In this paper, we propose a simple symmetric lambda-calculus corresponding to the negation-free natural deduction based bilateralism in proof-theoretic semantics. In our calculus, continuation types are represented as not negations of formulae but formulae with negative polarity. Function types are represented as the implication and but-not connectives in intuitionistic and paraconsistent logics, respectively. Our calculus is not only simple but also powerful as it includes a call-value calculus corresponding to the call-by-value dual calculus invented by Wadler. We show that mutual transformations between expressions and continuations are definable in our calculus to justify the duality of functions. We also show that every typable function has dual types. Thus, the duality of function is derived from bilateralism. 2012 ACM Subject Classification Theory of computation → Logic; Theory of computation → Type theory Keywords and phrases symmetric lambda-calculus, formulae-as-types, duality, bilateralism, natural deduction, proof-theoretic semantics, but-not connective, continuation, call-by-value Acknowledgements The author thanks Yosuke Fukuda, Tasuku Hiraishi, Kentaro Kikuchi, and Takeshi Tsukada for the fruitful discussions, which clarified contributions of the present paper.
    [Show full text]
  • Journal of Linguistics Negation, 'Presupposition'
    Journal of Linguistics http://journals.cambridge.org/LIN Additional services for Journal of Linguistics: Email alerts: Click here Subscriptions: Click here Commercial reprints: Click here Terms of use : Click here Negation, ‘presupposition’ and the semantics/pragmatics distinction ROBYN CARSTON Journal of Linguistics / Volume 34 / Issue 02 / September 1998, pp 309 ­ 350 DOI: null, Published online: 08 September 2000 Link to this article: http://journals.cambridge.org/abstract_S0022226798007063 How to cite this article: ROBYN CARSTON (1998). Negation, ‘presupposition’ and the semantics/pragmatics distinction. Journal of Linguistics, 34, pp 309­350 Request Permissions : Click here Downloaded from http://journals.cambridge.org/LIN, IP address: 144.82.107.34 on 12 Oct 2012 J. Linguistics (), –. Printed in the United Kingdom # Cambridge University Press Negation, ‘presupposition’ and the semantics/pragmatics distinction1 ROBYN CARSTON Department of Phonetics and Linguistics, University College London (Received February ; revised April ) A cognitive pragmatic approach is taken to some long-standing problem cases of negation, the so-called presupposition denial cases. It is argued that a full account of the processes and levels of representation involved in their interpretation typically requires the sequential pragmatic derivation of two different propositions expressed. The first is one in which the presupposition is preserved and, following the rejection of this, the second involves the echoic (metalinguistic) use of material falling in the scope of the negation. The semantic base for these processes is the standard anti- presuppositionalist wide-scope negation. A different view, developed by Burton- Roberts (a, b), takes presupposition to be a semantic relation encoded in natural language and so argues for a negation operator that does not cancel presuppositions.
    [Show full text]
  • Folktale Documentation Release 1.0
    Folktale Documentation Release 1.0 Quildreen Motta Nov 05, 2017 Contents 1 Guides 3 2 Indices and tables 5 3 Other resources 7 3.1 Getting started..............................................7 3.2 Folktale by Example........................................... 10 3.3 API Reference.............................................. 12 3.4 How do I................................................... 63 3.5 Glossary................................................. 63 Python Module Index 65 i ii Folktale Documentation, Release 1.0 Folktale is a suite of libraries for generic functional programming in JavaScript that allows you to write elegant modular applications with fewer bugs, and more reuse. Contents 1 Folktale Documentation, Release 1.0 2 Contents CHAPTER 1 Guides • Getting Started A series of quick tutorials to get you up and running quickly with the Folktale libraries. • API reference A quick reference of Folktale’s libraries, including usage examples and cross-references. 3 Folktale Documentation, Release 1.0 4 Chapter 1. Guides CHAPTER 2 Indices and tables • Global Module Index Quick access to all modules. • General Index All functions, classes, terms, sections. • Search page Search this documentation. 5 Folktale Documentation, Release 1.0 6 Chapter 2. Indices and tables CHAPTER 3 Other resources • Licence information 3.1 Getting started This guide will cover everything you need to start using the Folktale project right away, from giving you a brief overview of the project, to installing it, to creating a simple example. Once you get the hang of things, the Folktale By Example guide should help you understanding the concepts behind the library, and mapping them to real use cases. 3.1.1 So, what’s Folktale anyways? Folktale is a suite of libraries for allowing a particular style of functional programming in JavaScript.
    [Show full text]
  • CS 50010 Module 1
    CS 50010 Module 1 Ben Harsha Apr 12, 2017 Course details ● Course is split into 2 modules ○ Module 1 (this one): Covers basic data structures and algorithms, along with math review. ○ Module 2: Probability, Statistics, Crypto ● Goal for module 1: Review basics needed for CS and specifically Information Security ○ Review topics you may not have seen in awhile ○ Cover relevant topics you may not have seen before IMPORTANT This course cannot be used on a plan of study except for the IS Professional Masters program Administrative details ● Office: HAAS G60 ● Office Hours: 1:00-2:00pm in my office ○ Can also email for an appointment, I’ll be in there often ● Course website ○ cs.purdue.edu/homes/bharsha/cs50010.html ○ Contains syllabus, homeworks, and projects Grading ● Module 1 and module are each 50% of the grade for CS 50010 ● Module 1 ○ 55% final ○ 20% projects ○ 20% assignments ○ 5% participation Boolean Logic ● Variables/Symbols: Can only be used to represent 1 or 0 ● Operations: ○ Negation ○ Conjunction (AND) ○ Disjunction (OR) ○ Exclusive or (XOR) ○ Implication ○ Double Implication ● Truth Tables: Can be defined for all of these functions Operations ● Negation (¬p, p, pC, not p) - inverts the symbol. 1 becomes 0, 0 becomes 1 ● Conjunction (p ∧ q, p && q, p and q) - true when both p and q are true. False otherwise ● Disjunction (p v q, p || q, p or q) - True if at least one of p or q is true ● Exclusive Or (p xor q, p ⊻ q, p ⊕ q) - True if exactly one of p or q is true ● Implication (p → q) - True if p is false or q is true (q v ¬p) ●
    [Show full text]
  • Theorem Proving in Classical Logic
    MEng Individual Project Imperial College London Department of Computing Theorem Proving in Classical Logic Supervisor: Dr. Steffen van Bakel Author: David Davies Second Marker: Dr. Nicolas Wu June 16, 2021 Abstract It is well known that functional programming and logic are deeply intertwined. This has led to many systems capable of expressing both propositional and first order logic, that also operate as well-typed programs. What currently ties popular theorem provers together is their basis in intuitionistic logic, where one cannot prove the law of the excluded middle, ‘A A’ – that any proposition is either true or false. In classical logic this notion is provable, and the_: corresponding programs turn out to be those with control operators. In this report, we explore and expand upon the research about calculi that correspond with classical logic; and the problems that occur for those relating to first order logic. To see how these calculi behave in practice, we develop and implement functional languages for propositional and first order logic, expressing classical calculi in the setting of a theorem prover, much like Agda and Coq. In the first order language, users are able to define inductive data and record types; importantly, they are able to write computable programs that have a correspondence with classical propositions. Acknowledgements I would like to thank Steffen van Bakel, my supervisor, for his support throughout this project and helping find a topic of study based on my interests, for which I am incredibly grateful. His insight and advice have been invaluable. I would also like to thank my second marker, Nicolas Wu, for introducing me to the world of dependent types, and suggesting useful resources that have aided me greatly during this report.
    [Show full text]
  • Expressing Negation
    Expressing Negation William A. Ladusaw University of California, Santa Cruz Introduction* My focus in this paper is the syntax-semantics interface for the interpretation of negation in languages which show negative concord, as illustrated in the sentences in (1)-(4). (1) Nobody said nothing to nobody. [NS English] ‘Nobody said anything to anyone.’ (2) Maria didn’t say nothing to nobody. [NS English] ‘Maria didn’t say anything to anyone.’ (3) Mario non ha parlato di niente con nessuno. [Italian] ‘Mario hasn’t spoken with anyone about anything.’ (4) No m’ha telefonat ningú. [Catalan] ‘Nobody has telephoned me.’ Negative concord (NC) is the indication at multiple points in a clause of the fact that the clause is to be interpreted as semantically negated. In a widely spoken and even more widely understood nonstandard dialect of English, sentences (1) and (2) are interpreted as synonymous with those given as glosses, which are also well-formed in the dialect. The examples in (3) from Italian and (4) from Catalan illustrate the same phenomenon. The occurrence in these sentences of two or three different words, any one of which when correctly positioned would be sufficient to negate a clause, does not guarantee that their interpretation involves two or three independent expressions of negation. These clauses express only one negation, which is, on one view, simply redundantly indicated in two or three different places; each of the italicized terms in these sentences might be seen as having an equal claim to the function of expressing negation. However closer inspection indicates that this is not the correct view.
    [Show full text]
  • 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]