Logic in Linguistics
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
CAS LX 522 Syntax I
It is likely… CAS LX 522 IP This satisfies the EPP in Syntax I both clauses. The main DPj I′ clause has Mary in SpecIP. Mary The embedded clause has Vi+I VP is the trace in SpecIP. V AP Week 14b. PRO and control ti This specific instance of A- A IP movement, where we move a likely subject from an embedded DP I′ clause to a higher clause is tj generally called subject raising. I VP to leave Reluctance to leave Reluctance to leave Now, consider: Reluctant has two θ-roles to assign. Mary is reluctant to leave. One to the one feeling the reluctance (Experiencer) One to the proposition about which the reluctance holds (Proposition) This looks very similar to Mary is likely to leave. Can we draw the same kind of tree for it? Leave has one θ-role to assign. To the one doing the leaving (Agent). How many θ-roles does reluctant assign? In Mary is reluctant to leave, what θ-role does Mary get? IP Reluctance to leave Reluctance… DPi I′ Mary Vj+I VP In Mary is reluctant to leave, is V AP Mary is doing the leaving, gets Agent t Mary is reluctant to leave. j t from leave. i A′ Reluctant assigns its θ- Mary is showing the reluctance, gets θ roles within AP as A θ IP Experiencer from reluctant. required, Mary moves reluctant up to SpecIP in the main I′ clause by Spellout. ? And we have a problem: I vP But what gets the θ-role to Mary appears to be getting two θ-roles, from leave, and what v′ in violation of the θ-criterion. -
The Linguistic Description of Opaque Contexts Pdf, Epub, Ebook
THE LINGUISTIC DESCRIPTION OF OPAQUE CONTEXTS PDF, EPUB, EBOOK Janet Dean Fodor | 384 pages | 26 Nov 2015 | Taylor & Francis Ltd | 9781138989535 | English | London, United Kingdom The Linguistic Description of Opaque Contexts PDF Book This also concerns noun phrases embedded under attitude verbs; consider:. A naturalobjectionto ourproposalis thatthe T-sentencewe give for 'Galileo said that the earthmoves' will not enable someone who grasps it alone to under- stand the sentence for which it gives truthconditions. Peter Trudgill offers examples of non-transparent and transparent compounds: "The English word dentist is not semantically transparent whereas the Norwegian word tannlege , literally 'tooth doctor,' is" A Glossary of Sociolinguistics , This cannot mean as if they had asserted them, so we take it that the idea is basically the same as the one we have in mind. See Lepore and Ludwig for a suggestion for an importantmodificationof Davidson's proposal in the context of a general truth-theoreticaltreatmentof tense and temporaladverbs. The above observation about translationhelps on another front. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. This way of drawing attentionto the appropriaterelation is does not commit us to the existence of propo- sitions; rather,it is a useful heuristicgiven the familiarityof puttingit this way. Perhaps the most popular solution to the problem of providing a compositional semantics for naturallanguages aims to exploit this fact by treat- ing that-clausesas referringto intensional entities-entities at least as as finely individuatedas the meanings of sentences. -
A Cross-Cultural and Pragmatic Study of Felicity Conditions in the Same-Sex Marriage Discourse
Journal of Foreign Languages, Cultures and Civilizations June 2016, Vol. 4, No. 1, pp. 58-72 ISSN 2333-5882 (Print) 2333-5890 (Online) Copyright © The Author(s). All Rights Reserved. Published by American Research Institute for Policy Development DOI: 10.15640/jflcc.v4n1a7 URL: https://doi.org/10.15640/jflcc.v4n1a7 A Cross-Cultural and Pragmatic Study of Felicity Conditions in the Same-Sex Marriage Discourse Hashim Aliwy Mohammed Al-Husseini1 & Ghayth K. Shaker Al-Shaibani2 Abstract This paper investigates whether there are Felicity Conditions (FCs) for the same-sex marriage as being a contemporary practice of marriage relations in some countries. As such, the researchers adopt Austin’s (1962) Felicity Conditions (FCs) to examine if conditions of satisfaction are applicable to the same-sex marriage in Christian and Islamic cultures. The researchers focus on analysing and discussing the social, religious, and linguistic conventional procedures of the speech acts of marriage, specifically in the same-sex marriage discourse. We find out that same-sex marriage in Christianity is totally different from the traditional marriage with regard to the social, religious, and linguistic conventions. Consequently, we concluded that same-sex marriage discourse has no FCs in contrast to the traditional marriage in Christianity as well as marriage in Islam which has not changed in form and opposite sex marriage. Keyword: Felicity Conditions; homosexual relations; marriage speech acts; same-sex marriage discourse; conventional procedures 1. Introduction Trosborg (2010, p.3) stated that one can principally affirm that all pragmatic aspects, namely speech act theory and theory of politeness, may be liable to cross-cultural comparisons between two speech communities and/or two cultures. -
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. -
Performative Speech Act Verbs in Present Day English
PERFORMATIVE SPEECH ACT VERBS IN PRESENT DAY ENGLISH ELENA LÓPEZ ÁLVAREZ Universidad Complutense de Madrid RESUMEN. En esta contribución se estudian los actos performativos y su influencia en el inglés de hoy en día. A partir de las teorías de J. L. Austin, entre otros autores, se desarrolla un panorama de esta orientación de la filosofía del lenguaje de Austin. PALABRAS CLAVE. Actos performativos, enunciado performativo, inglés. ABSTRACT. This paper focuses on performative speech act verbs in present day English. Reading the theories of J. L. Austin, among others,. With the basis of authors as J. L. Austin, this paper develops a brief landscape about this orientation of Austin’s linguistic philosophy. KEY WORDS. Performative speech act verbs, performative utterance, English. 1. INTRODUCCIÓN 1.1. HISTORICAL THEORETICAL BACKGROUND 1.1.1. The beginnings: J.L. Austin The origin of performative speech acts as we know them today dates back to the William James Lectures, the linguistic-philosophical theories devised and delivered by J.L. Austin at Harvard University in 1955, and collected into a series of lectures entitled How to do things with words, posthumously published in 1962. Austin was one of the most influential philosophers of his time. In these lectures, he provided a thorough exploration of performative speech acts, which was an extremely innovative area of study in those days. In the following pages, Austin’s main ideas (together with some comments by other authors) will be presented. 1.1.1.1. Constative – performative distinction In these lectures, Austin begins by making a clear distinction between constative and performative utterances. -
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. -
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. -
Syntax and Semantics of Propositional Logic
INTRODUCTIONTOLOGIC Lecture 2 Syntax and Semantics of Propositional Logic. Dr. James Studd Logic is the beginning of wisdom. Thomas Aquinas Outline 1 Syntax vs Semantics. 2 Syntax of L1. 3 Semantics of L1. 4 Truth-table methods. Examples of syntactic claims ‘Bertrand Russell’ is a proper noun. ‘likes logic’ is a verb phrase. ‘Bertrand Russell likes logic’ is a sentence. Combining a proper noun and a verb phrase in this way makes a sentence. Syntax vs. Semantics Syntax Syntax is all about expressions: words and sentences. ‘Bertrand Russell’ is a proper noun. ‘likes logic’ is a verb phrase. ‘Bertrand Russell likes logic’ is a sentence. Combining a proper noun and a verb phrase in this way makes a sentence. Syntax vs. Semantics Syntax Syntax is all about expressions: words and sentences. Examples of syntactic claims ‘likes logic’ is a verb phrase. ‘Bertrand Russell likes logic’ is a sentence. Combining a proper noun and a verb phrase in this way makes a sentence. Syntax vs. Semantics Syntax Syntax is all about expressions: words and sentences. Examples of syntactic claims ‘Bertrand Russell’ is a proper noun. ‘Bertrand Russell likes logic’ is a sentence. Combining a proper noun and a verb phrase in this way makes a sentence. Syntax vs. Semantics Syntax Syntax is all about expressions: words and sentences. Examples of syntactic claims ‘Bertrand Russell’ is a proper noun. ‘likes logic’ is a verb phrase. Combining a proper noun and a verb phrase in this way makes a sentence. Syntax vs. Semantics Syntax Syntax is all about expressions: words and sentences. Examples of syntactic claims ‘Bertrand Russell’ is a proper noun. -
Exclamatives, Normalcy Conditions and Common Ground
Revue de Sémantique et Pragmatique 40 | 2016 Exclamation et intersubjectivité Exclamatives, Normalcy Conditions and Common Ground Franz d’Avis Electronic version URL: http://journals.openedition.org/rsp/279 DOI: 10.4000/rsp.279 ISSN: 2610-4377 Publisher Presses universitaires d'Orléans Printed version Date of publication: 1 March 2017 Number of pages: 17-34 ISSN: 1285-4093 Electronic reference Franz d’Avis, « Exclamatives, Normalcy Conditions and Common Ground », Revue de Sémantique et Pragmatique [Online], 40 | 2016, Online since 01 March 2018, connection on 10 December 2020. URL : http://journals.openedition.org/rsp/279 ; DOI : https://doi.org/10.4000/rsp.279 Revue de Sémantique et Pragmatique Revue de Sémantique et Pragmatique. 2016. Numéro 40. pp. 17-34. Exclamatives, Normalcy Conditions and Common Ground Franz d’Avis Johannes Gutenberg-Universität Mainz 1. INTRODUCTION The starting point for the search for exclamative sentence types in a lan- guage is often the description of a certain function that utterances of sentences of that type would have. One formulation could be: With the use of an excla- mative sentence, a speaker expresses that the state of affairs described by a proposition given in the sentence is not in accordance with his expectations about the world.1 Exclamative utterances may include an emotional attitude on the part of the speaker, which is often described as surprise in the literature, cf. Altmann (1987, 1993a), Michaelis/Lambrecht (1996), d’Avis (2001), Michaelis (2001), Roguska (2008) and others. Surprise is an attitude that is based on the belief that something unexpected is the case, see from a psychological point of view Reisenzein (2000). -
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. -
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. -
Felicity Conditions for Counterfactual Conditionals Containing Proper
Counterfactuals in Context: Felicity conditions for counterfactual conditionals containing proper names William Robinson A thesis Submitted in partial fulfillment of the requirements for the degree of Master of Arts University of Washington 2013 Committee: Toshiyuki Ogihara Barbara Citko Program Authorized to Offer Degree: Linguistics 2 ©Copyright 2013 William Robinson 3 University of Washington Abstract Counterfactuals in Context: Felicity conditions for counterfactual conditionals containing proper names William Robinson Chair of the Supervisory Committee: Toshiyuki Ogihara PhD Linguistics Linguistics This thesis provides felicity conditions for counterfactual conditionals containing proper names in which essential changes to an individual are counterfactually posited using contrastive focus in either the antecedent or consequent clause. The felicity conditions proposed are an adaptation of Heim’s (1992) CCP Semantics into Kratzer’s (1981) truth conditions for counterfactual conditionals in which the partition function f(w) serves as the local context of evaluation for the antecedent clause, while the set of worlds characterized by the antecedent serves as the local context for the consequent clause. In order for the felicity conditions to generate the right results, it is shown that they must be couched in a rigid designator/essentialist framework inspired by Kripke (1980). This correctly predicts that consequents containing rigid designators are infelicitous when their input context—the set of worlds accessible from the antecedent clause— does not contain a suitable referent. 4 Introduction We use counterfactual conditionals like (1a-b) to make claims about the “ways things could have been,” not about the way things actually are1 (Lewis 1973, p.84). The antecedent clause of a counterfactual conditional posits a change to the actual world from which the consequent clause would/might follow.