1 Explicit and Implicit Negation, Negative Polarity, and Levels Of
Total Page:16
File Type:pdf, Size:1020Kb
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. -
Analyzing Words with Roots and Affixes Essential Question: How Can I Determine the Meaning of a Word Using Its Roots And/Or Affixes? TEK
Analyzing Words with Roots and Affixes Essential Question: How can I determine the meaning of a word using its roots and/or affixes? TEK (2) Reading/Vocabulary Development. Students understand new vocabulary and use it when reading and writing. Students are expected to: (A) determine the meaning of grade-level academic English words derived from Latin, Greek, or other linguistic roots and affixes Vocabulary Affix – word part Root - word part added either to that gives the the beginning or word its primary end of a root (or meaning base word) to change its root meaning Vocabulary root prefix suffix Vocabulary incredible cred in- -ible not + believe + able to Vocabulary biography graph bio- -y life + write + condition of Root & Affix Flipbooks O Use the lists of prefixes, roots, and suffixes on the slides that follow to create vocabulary flip books. We will be using our flip books to practice analyzing and building different words. O On the front side of the card (hole in the top left-hand corner), write the root or affix. Try to add a picture or graphic, if can think of one, to help you remember the meaning. O On the back side of the card, write the definition of the word part, and at least two examples within-a-word. On my website, go to “STAAR Review Centers” on the right-side. Prefixes Root, Prefix or Meaning Examples Suffix antisocial, antiseptic, antithesis, antibody, anti, ant against, opposite antinomies, antifreeze, antipathy from, down, away, to do detach, deploy, derange, decrease, deodorize, de- the opposite, reverse, devoid, deflate, degenerate against out of, away from, exit, exhale, exclusive, exceed, explosion, ex- ex- lacking, former mayor exter-, extra-, external, extrinsic, extraordinary, extrapolate, outside of, beyond extro- extraneous, extrovert in, im into, on, near, towards instead, import illegible, irresolute, inaction, inviolate, in, im, il, ir not innocuous, intractable, innocent, impregnable, impossible, imposter Notice that some affixes have multiple meanings. -
Download Download
The Genesis of Michif: A First Hypothesis PETER BAKKER University of Amsterdam Michif as a Mixed Language Since Richard Rhodes read the first paper on Michif at the Eighth Algon quian Conference in 1977, much work has been done on the language. A number of additional papers have been read at the Algonquian Conference (Weaver 1983; Rhodes 1985, 1987; Papen 1987) and others have been pub lished elsewhere (see Bakker 1989c for a bibliography). Most of this work focussed either on description or on the problem of genetic classification that this language poses. Michif remains an unusual language, with its verb phrase from Cree and its noun phrase from French. Does the language have two half grammars, and two phonological systems? Is it a Romance or an Algonquian language, or a Creole, a pidgin, a mixed language, or whatever? These are the questions that people have tried to answer. It is now probably agreed that Michif is a mixed language. It is a convincing case, even for those linguists who maintain that mixed languages do not exist. Its mixture is also unique: Michif has (Plains) Cree verbs and French nouns. No other language has a similar distribution of elements from two different languages. Nobody thus far has attempted to explain its genesis, although this is one of the more intriguing problems this language poses. In this paper1 I will present a preliminary answer to this question. The problem can be phrased as consisting of two sub-questions: first, why is Michif a mixed language? Second, why is the language mixed in this particular way? To Fie dwork on Cree and Michif were made possible with a Canadian Studies Graduate Student Award in 1987-1988. -
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. -
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 309350 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. -
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. -
Types and Functions of Reduplication in Palembang
Journal of the Southeast Asian Linguistics Society JSEALS 12.1 (2019): 113-142 ISSN: 1836-6821, DOI: http://hdl.handle.net/10524/52447 University of Hawaiʼi Press TYPES AND FUNCTIONS OF REDUPLICATION IN PALEMBANG Mardheya Alsamadani & Samar Taibah Wayne State University [email protected] & [email protected] Abstract In this paper, we study the morphosemantic aspects of reduplication in Palembang (also known as Musi). In Palembang, both content and function words undergo reduplication, generating a wide variety of semantic functions, such as pluralization, iteration, distribution, and nominalization. Productive reduplication includes full reduplication and reduplication plus affixation, while fossilized reduplication includes partial reduplication and rhyming reduplication. We employed the Distributed Morphology theory (DM) (Halle and Marantz 1993, 1994) to account for these different patterns of reduplication. Moreover, we compared the functions of Palembang reduplication to those of Malay and Indonesian reduplication. Some instances of function word reduplication in Palembang were not found in these languages, such as reduplication of question words and reduplication of negators. In addition, Palembang partial reduplication is fossilized, with only a few examples collected. In contrast, Malay partial reduplication is productive and utilized to create new words, especially words borrowed from English (Ahmad 2005). Keywords: Reduplication, affixation, Palembang/Musi, morphosemantics ISO 639-3 codes: mui 1 Introduction This paper has three purposes. The first is to document the reduplication patterns found in Palembang based on the data collected from three Palembang native speakers. Second, we aim to illustrate some shared features of Palembang reduplication with those found in other Malayic languages such as Indonesian and Malay. The third purpose is to provide a formal analysis of Palembang reduplication based on the Distributed Morphology Theory. -
Linguistics 1A Morphology 2 Complex Words
Linguistics 1A Morphology 2 Complex words In the previous lecture we noted that words can be classified into different categories, such as verbs, nouns, adjectives, prepositions, determiners, and so on. We can make another distinction between word types as well, a distinction that cuts across these categories. Consider the verbs, nouns and adjectives in (1)-(3), respectively. It will probably be intuitively clear that the words in the (b) examples are complex in a way that the words in the (a) examples are not, and not just because the words in the (b) examples are, on the whole, longer. (1) a. to walk, to dance, to laugh, to kiss b. to purify, to enlarge, to industrialize, to head-hunt (2) a. house, corner, zebra b. collection, builder, sea horse (3) c. green, old, sick d. regional, washable, honey-sweet The words in the (a) examples in (1)-(3) do not have any internal structure. It does not seem to make much sense to say that walk , for example, consists of the smaller parts wa and lk . But for the words in the (b) examples this is different. These are built up from smaller parts that each contribute their own distinct bit of meaning to the whole. For example, builder consists of the verbal part build with its associated meaning, and the part –er that contributes a ‘doer’ reading, just as it does in kill-er , sell-er , doubt-er , and so on. Similarly, washable consists of wash and a part –able that contributes a meaning aspect that might be described loosely as ‘can be done’, as it does in refundable , testable , verifiable etc. -
Logic, Sets, and Proofs David A
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Statements. A logical statement is a mathematical statement that is either true or false. Here we denote logical statements with capital letters A; B. Logical statements be combined to form new logical statements as follows: Name Notation Conjunction A and B Disjunction A or B Negation not A :A Implication A implies B if A, then B A ) B Equivalence A if and only if B A , B Here are some examples of conjunction, disjunction and negation: x > 1 and x < 3: This is true when x is in the open interval (1; 3). x > 1 or x < 3: This is true for all real numbers x. :(x > 1): This is the same as x ≤ 1. Here are two logical statements that are true: x > 4 ) x > 2. x2 = 1 , (x = 1 or x = −1). Note that \x = 1 or x = −1" is usually written x = ±1. Converses, Contrapositives, and Tautologies. We begin with converses and contrapositives: • The converse of \A implies B" is \B implies A". • The contrapositive of \A implies B" is \:B implies :A" Thus the statement \x > 4 ) x > 2" has: • Converse: x > 2 ) x > 4. • Contrapositive: x ≤ 2 ) x ≤ 4. 1 Some logical statements are guaranteed to always be true. These are tautologies. Here are two tautologies that involve converses and contrapositives: • (A if and only if B) , ((A implies B) and (B implies A)). In other words, A and B are equivalent exactly when both A ) B and its converse are true. -
RELATIONAL PARAMETRICITY and CONTROL 1. Introduction the Λ
Logical Methods in Computer Science Vol. 2 (3:3) 2006, pp. 1–22 Submitted Dec. 16, 2005 www.lmcs-online.org Published Jul. 27, 2006 RELATIONAL PARAMETRICITY AND CONTROL MASAHITO HASEGAWA Research Institute for Mathematical Sciences, Kyoto University, Kyoto 606-8502 Japan, and PRESTO, Japan Science and Technology Agency e-mail address: [email protected] Abstract. We study the equational theory of Parigot’s second-order λµ-calculus in con- nection with a call-by-name continuation-passing style (CPS) translation into a fragment of the second-order λ-calculus. It is observed that the relational parametricity on the tar- get calculus induces a natural notion of equivalence on the λµ-terms. On the other hand, the unconstrained relational parametricity on the λµ-calculus turns out to be inconsis- tent. Following these facts, we propose to formulate the relational parametricity on the λµ-calculus in a constrained way, which might be called “focal parametricity”. Dedicated to Prof. Gordon Plotkin on the occasion of his sixtieth birthday 1. Introduction The λµ-calculus, introduced by Parigot [26], has been one of the representative term calculi for classical natural deduction, and widely studied from various aspects. Although it still is an active research subject, it can be said that we have some reasonable un- derstanding of the first-order propositional λµ-calculus: we have good reduction theories, well-established CPS semantics and the corresponding operational semantics, and also some canonical equational theories enjoying semantic completeness [16, 24, 25, 36, 39]. The last point cannot be overlooked, as such complete axiomatizations provide deep understand- ing of equivalences between proofs and also of the semantic structure behind the syntactic presentation. -
Frege and the Logic of Sense and Reference
FREGE AND THE LOGIC OF SENSE AND REFERENCE Kevin C. Klement Routledge New York & London Published in 2002 by Routledge 29 West 35th Street New York, NY 10001 Published in Great Britain by Routledge 11 New Fetter Lane London EC4P 4EE Routledge is an imprint of the Taylor & Francis Group Printed in the United States of America on acid-free paper. Copyright © 2002 by Kevin C. Klement All rights reserved. No part of this book may be reprinted or reproduced or utilized in any form or by any electronic, mechanical or other means, now known or hereafter invented, including photocopying and recording, or in any infomration storage or retrieval system, without permission in writing from the publisher. 10 9 8 7 6 5 4 3 2 1 Library of Congress Cataloging-in-Publication Data Klement, Kevin C., 1974– Frege and the logic of sense and reference / by Kevin Klement. p. cm — (Studies in philosophy) Includes bibliographical references and index ISBN 0-415-93790-6 1. Frege, Gottlob, 1848–1925. 2. Sense (Philosophy) 3. Reference (Philosophy) I. Title II. Studies in philosophy (New York, N. Y.) B3245.F24 K54 2001 12'.68'092—dc21 2001048169 Contents Page Preface ix Abbreviations xiii 1. The Need for a Logical Calculus for the Theory of Sinn and Bedeutung 3 Introduction 3 Frege’s Project: Logicism and the Notion of Begriffsschrift 4 The Theory of Sinn and Bedeutung 8 The Limitations of the Begriffsschrift 14 Filling the Gap 21 2. The Logic of the Grundgesetze 25 Logical Language and the Content of Logic 25 Functionality and Predication 28 Quantifiers and Gothic Letters 32 Roman Letters: An Alternative Notation for Generality 38 Value-Ranges and Extensions of Concepts 42 The Syntactic Rules of the Begriffsschrift 44 The Axiomatization of Frege’s System 49 Responses to the Paradox 56 v vi Contents 3. -
Affix Ordering in Optimal Construction Morphology
John Benjamins Publishing Company This is a contribution from Morphological Metatheory. Edited by Daniel Siddiqi and Heidi Harley. © 2016. John Benjamins Publishing Company This electronic file may not be altered in any way. The author(s) of this article is/are permitted to use this PDF file to generate printed copies to be used by way of offprints, for their personal use only. Permission is granted by the publishers to post this file on a closed server which is accessible to members (students and staff) only of the author’s/s’ institute, it is not permitted to post this PDF on the open internet. For any other use of this material prior written permission should be obtained from the publishers or through the Copyright Clearance Center (for USA: www.copyright.com). Please contact [email protected] or consult our website: www.benjamins.com Tables of Contents, abstracts and guidelines are available at www.benjamins.com Affix ordering in Optimal Construction Morphology Sharon Inkelas University of California, Berkeley This paper sketches an integrated approach to affix ordering within Optimal Construction Morphology, a bottom-up, competition based model of word production in which each step of affixation is the optimal choice among competing possibilities (Caballero & Inkelas 2013). Optimality-theoretic models are natural fits for affix ordering, a complex phenomenon governed by a mix of conflicting universal and language-specific factors which interact differently in every language. This study covers familiar, global cross-linguistic principles such as semantic relevance (e.g., Bybee 1985) and scope (e.g., Baker 1988; Rice 2000), integrating them with local lexical selectional restrictions (e.g., Fabb 1988); it also incorporates usage-based factors such as Complexity-Based Ordering (e.g., Hay & Plag 2004).