Sentence, Proposition, Judgment, Statement, and Fact: Speaking About the Written English Used in Logic John Corcoran
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Truth-Bearers and Truth Value*
Truth-Bearers and Truth Value* I. Introduction The purpose of this document is to explain the following concepts and the relationships between them: statements, propositions, and truth value. In what follows each of these will be discussed in turn. II. Language and Truth-Bearers A. Statements 1. Introduction For present purposes, we will define the term “statement” as follows. Statement: A meaningful declarative sentence.1 It is useful to make sure that the definition of “statement” is clearly understood. 2. Sentences in General To begin with, a statement is a kind of sentence. Obviously, not every string of words is a sentence. Consider: “John store.” Here we have two nouns with a period after them—there is no verb. Grammatically, this is not a sentence—it is just a collection of words with a dot after them. Consider: “If I went to the store.” This isn’t a sentence either. “I went to the store.” is a sentence. However, using the word “if” transforms this string of words into a mere clause that requires another clause to complete it. For example, the following is a sentence: “If I went to the store, I would buy milk.” This issue is not merely one of conforming to arbitrary rules. Remember, a grammatically correct sentence expresses a complete thought.2 The construction “If I went to the store.” does not do this. One wants to By Dr. Robert Tierney. This document is being used by Dr. Tierney for teaching purposes and is not intended for use or publication in any other manner. 1 More precisely, a statement is a meaningful declarative sentence-type. -
Rhetorical Analysis
RHETORICAL ANALYSIS PURPOSE Almost every text makes an argument. Rhetorical analysis is the process of evaluating elements of a text and determining how those elements impact the success or failure of that argument. Often rhetorical analyses address written arguments, but visual, oral, or other kinds of “texts” can also be analyzed. RHETORICAL FEATURES – WHAT TO ANALYZE Asking the right questions about how a text is constructed will help you determine the focus of your rhetorical analysis. A good rhetorical analysis does not try to address every element of a text; discuss just those aspects with the greatest [positive or negative] impact on the text’s effectiveness. THE RHETORICAL SITUATION Remember that no text exists in a vacuum. The rhetorical situation of a text refers to the context in which it is written and read, the audience to whom it is directed, and the purpose of the writer. THE RHETORICAL APPEALS A writer makes many strategic decisions when attempting to persuade an audience. Considering the following rhetorical appeals will help you understand some of these strategies and their effect on an argument. Generally, writers should incorporate a variety of different rhetorical appeals rather than relying on only one kind. Ethos (appeal to the writer’s credibility) What is the writer’s purpose (to argue, explain, teach, defend, call to action, etc.)? Do you trust the writer? Why? Is the writer an authority on the subject? What credentials does the writer have? Does the writer address other viewpoints? How does the writer’s word choice or tone affect how you view the writer? Pathos (a ppeal to emotion or to an audience’s values or beliefs) Who is the target audience for the argument? How is the writer trying to make the audience feel (i.e., sad, happy, angry, guilty)? Is the writer making any assumptions about the background, knowledge, values, 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. -
Chapter 3 – Describing Syntax and Semantics CS-4337 Organization of Programming Languages
!" # Chapter 3 – Describing Syntax and Semantics CS-4337 Organization of Programming Languages Dr. Chris Irwin Davis Email: [email protected] Phone: (972) 883-3574 Office: ECSS 4.705 Chapter 3 Topics • Introduction • The General Problem of Describing Syntax • Formal Methods of Describing Syntax • Attribute Grammars • Describing the Meanings of Programs: Dynamic Semantics 1-2 Introduction •Syntax: the form or structure of the expressions, statements, and program units •Semantics: the meaning of the expressions, statements, and program units •Syntax and semantics provide a language’s definition – Users of a language definition •Other language designers •Implementers •Programmers (the users of the language) 1-3 The General Problem of Describing Syntax: Terminology •A sentence is a string of characters over some alphabet •A language is a set of sentences •A lexeme is the lowest level syntactic unit of a language (e.g., *, sum, begin) •A token is a category of lexemes (e.g., identifier) 1-4 Example: Lexemes and Tokens index = 2 * count + 17 Lexemes Tokens index identifier = equal_sign 2 int_literal * mult_op count identifier + plus_op 17 int_literal ; semicolon Formal Definition of Languages • Recognizers – A recognition device reads input strings over the alphabet of the language and decides whether the input strings belong to the language – Example: syntax analysis part of a compiler - Detailed discussion of syntax analysis appears in Chapter 4 • Generators – A device that generates sentences of a language – One can determine if the syntax of a particular sentence is syntactically correct by comparing it to the structure of the generator 1-5 Formal Methods of Describing Syntax •Formal language-generation mechanisms, usually called grammars, are commonly used to describe the syntax of programming languages. -
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. -
Gottfried Wilhelm Leibniz (1646-1716)
Gottfried Wilhelm Leibniz (1646-1716) • His father, a professor of Philosophy, died when he was small, and he was brought up by his mother. • He learnt Latin at school in Leipzig, but taught himself much more and also taught himself some Greek, possibly because he wanted to read his father’s books. • He studied law and logic at Leipzig University from the age of fourteen – which was not exceptionally young for that time. • His Ph D thesis “De Arte Combinatoria” was completed in 1666 at the University of Altdorf. He was offered a chair there but turned it down. • He then met, and worked for, Baron von Boineburg (at one stage prime minister in the government of Mainz), as a secretary, librarian and lawyer – and was also a personal friend. • Over the years he earned his living mainly as a lawyer and diplomat, working at different times for the states of Mainz, Hanover and Brandenburg. • But he is famous as a mathematician and philosopher. • By his own account, his interest in mathematics developed quite late. • An early interest was mechanics. – He was interested in the works of Huygens and Wren on collisions. – He published Hypothesis Physica Nova in 1671. The hypothesis was that motion depends on the action of a spirit ( a hypothesis shared by Kepler– but not Newton). – At this stage he was already communicating with scientists in London and in Paris. (Over his life he had around 600 scientific correspondents, all over the world.) – He met Huygens in Paris in 1672, while on a political mission, and started working with him. -
Three Schools of Paraconsistency K T∗ P D,M U [email protected]
Three Schools of Paraconsistency K T∗ P D,M U [email protected] Received by Greg Restall Published July 1, 2003 http://www.philosophy.unimelb.edu.au/ajl/2003 c 2003 Koji Tanaka Abstract: A logic is said to be paraconsistent if it does not allow everything to follow from contradictory premises. There are several approaches to paraconsistency. This paper is concerned with several philosophical posi- tions on paraconsistency. In particular, it concerns three ‘schools’ of para- consistency: Australian, Belgian and Brazilian. The Belgian and Brazilian schools have raised some objections to the dialetheism of the Australian school. I argue that the Australian school of paraconsistency need not be closed down on the basis of the Belgian and Brazilian schools’ objections. In the appendix of the paper, I also argue that the Brazilian school’s view of logic is not coherent. But though logic has come a long way very recently, it has a longer way to go, both in whom it involves and what it investigates. There are, for in- stance, virtually no black researchers, and exceedingly few women are en- gaged; and for all the proclaimed rationality of modern humans and their institutions, logic touches comparatively little human practice. Differ- ently, there remain many notions of considerable logical import, some of historical significance, of which we lack decent accounts or, sometimes, a clear appreciation. To the satisfactory elucidation of these, sociative logics can make essential contributions. Sylvan (1989) p. 133. 1 I A logic is said to be paraconsistent if it does not allow everything to fol- low from contradictory premises: it is not the case that for any α and β, ∗I would like to thank Graham Priest for making some of the ideas contained in the paper clear and for his comments on drafts of the paper. -
Publications of John Corcoran OCT 04
OCTOBER 2004 PUBLICATIONS OF JOHN CORCORAN I. Articles. MR indicates review in Mathematical Reviews. J indicates available at JSTOR. G indicates available at Google by entering John Corcoran plus the complete title. 1.J Three Logical Theories, Philosophy of Science 36 (1969) 153-77. 2. Logical Consequence in Modal Logic: Natural Deduction in S5 (co-author G. Weaver), Notre Dame Journal of Formal Logic 10 (1969) 370-84. 3. Discourse Grammars and the Structure of Mathematical Reasoning I: Mathematical Reasoning and the Stratification of Language, Journal of Structural Learning 3 (1971) #1, 55-74. 4. Discourse Grammars and the Structure of Mathematical Reasoning II: The Nature of a Correct Theory of Proof and Its Value, Journal of Structural Learning 3 (1971) #2, 1-16. 5. Discourse Grammars and the Structure of Mathematical Reasoning III: Two Theories of Proof, Journal of Structural Learning 3 (1971) #3, 1-24. 6. Notes on a Semantic Analysis of Variable Binding Term Operators (co-author John Herring), Logique et Analyse 55 (1971) 646-57. MR46#6989. 7. Variable Binding Term Operators, (co-authors Wm. Hatcher, John Herring) Zeitschrift fu"r mathematische Logik und Grundlagen der Mathematik 18 (1972) 177-82. MR46#5098. 8.J Conceptual Structure of Classical Logic, Philosophy & Phenomenological Research 33 (1972) 25-47. 9. Logical Consequence in Modal Logic: Some Semantic Systems for S4 (co-author G. Weaver), Notre Dame Journal of Formal Logic 15 (1974) 370-78. MR50#4253. 10, 11, and 12. Revisions of 3, 4 and 5 in Structural Learning II Issues and Approaches, ed. J. Scandura, Gordon and Breach Science Publishers, New York (1976). -
Newton Da Costa on Non-Reflexive Logics and Identity
Becker Arenhart, Jonas Rafael Newton da Costa on non-reflexive logics and identity Esta obra está bajo una Licencia Creative Commons Argentina. Atribución - No Comercial - Sin Obra Derivada 2.5 https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ Documento descargado de RIDAA-UNQ Repositorio Institucional Digital de Acceso Abierto de la Universidad Nacional de Quilmes de la Universidad Nacional de Quilmes Cita recomendada: Becker Arenhart, J. R. (2019). Newton da Costa on non-reflexive logics and identity. Metatheoria, 9(2), 19-31. Disponible en RIDAA-UNQ Repositorio Institucional Digital de Acceso Abierto de la Universidad Nacional de Quilmes http://ridaa.unq.edu.ar/handle/20.500.11807/2536 Puede encontrar éste y otros documentos en: https://ridaa.unq.edu.ar Newton da Costa on Non-Reflexive Logics and Identity Newton da Costa sobre la lógica no-reflexiva y la identidad Jonas Rafael Becker Arenhart† Abstract Newton da Costa pioneered first-order systems of so-called non-reflexive logics (NRL). According to those systems of logic, the reflexive law of identity is restricted; it does not apply to every kind of object the system deals with. NRL were later developed into higher-order systems and quasi-set theory by Décio Krause. The main motivation to develop such systems came from non-relativistic quantum mechanics. Intuitively, it is argued that quantum entities somehow “lost their identities”, they are non-individuals. Non-reflexive logics are the systems employed to formally underpin such a metaphysical interpretation of the theory. In this paper we re-access da Costa’s contributions in the light of recent developments on both the metaphysics of quantum mechanics and on the latest developments of the formalism. -
13 QUESTIONS ABOUT UNIVERSAL LOGIC 13 Questions to Jean-Yves B´Eziau, by Linda Eastwood
Bulletin of the Section of Logic Volume 35:2/3 (2006), pp. 133–150 Jean-Yves B´eziau 13 QUESTIONS ABOUT UNIVERSAL LOGIC 13 questions to Jean-Yves B´eziau, by Linda Eastwood The expression “universal logic” prompts a number of misunderstandings pressing up against to the confusion prevailing nowadays around the very notion of logic. In order to clear up such equivocations, I prepared a series of questions to Jean-Yves B´eziau,who has been working for many years on his project of universal logic, recently in the University of Neuchˆatel, Switzerland. 1. Although your proposal to develop a universal logic is very appealing, isn’t it a utopian one? Isn’t it an absurd, or even dangerous thing to believe that it would be possible to develop a unique logic accounting for everything? Let us immediately reject some misunderstanding; universal logic, as I understand it, is not one universal logic. In fact, from the viewpoint of universal logic the existence of one universal logic is not even possible, and this is a result that can easily be shown. One might thus say somehow ironically the following: according to universal logic there is no universal logic. Some people in some countries have always tried to elaborate a uni- versal system that would account for any sort of reasoning, or reasoning as a whole. Aristotelian logic was depicted itself as a universal one. More recently, first-order classical logic appeared to some as a universal system accounting for mathematical reasoning as well as current one, that is, the one used to buy your bread at the bakery. -
Philosophy of Language in the Twentieth Century Jason Stanley Rutgers University
Philosophy of Language in the Twentieth Century Jason Stanley Rutgers University In the Twentieth Century, Logic and Philosophy of Language are two of the few areas of philosophy in which philosophers made indisputable progress. For example, even now many of the foremost living ethicists present their theories as somewhat more explicit versions of the ideas of Kant, Mill, or Aristotle. In contrast, it would be patently absurd for a contemporary philosopher of language or logician to think of herself as working in the shadow of any figure who died before the Twentieth Century began. Advances in these disciplines make even the most unaccomplished of its practitioners vastly more sophisticated than Kant. There were previous periods in which the problems of language and logic were studied extensively (e.g. the medieval period). But from the perspective of the progress made in the last 120 years, previous work is at most a source of interesting data or occasional insight. All systematic theorizing about content that meets contemporary standards of rigor has been done subsequently. The advances Philosophy of Language has made in the Twentieth Century are of course the result of the remarkable progress made in logic. Few other philosophical disciplines gained as much from the developments in logic as the Philosophy of Language. In the course of presenting the first formal system in the Begriffsscrift , Gottlob Frege developed a formal language. Subsequently, logicians provided rigorous semantics for formal languages, in order to define truth in a model, and thereby characterize logical consequence. Such rigor was required in order to enable logicians to carry out semantic proofs about formal systems in a formal system, thereby providing semantics with the same benefits as increased formalization had provided for other branches of mathematics. -
Winter 2011 Department of Philosophy
Department of Philosophy Noûsletter Number 19 - Winter 2011 No. 19 · Fall 2011 noûsletter Page 2 Table of Contents IGERT Fellowship Work .................................................... 21 Letter from the Chair .............................................................. 3 Perry Awards for Best Dissertation ............................. 21 Letter from the Director of Graduate Studies ............ 5 2011 Steinberg Essay Prize Winners .......................... 22 In Remembrance ............................................................................ 6 2011 Whitman Scholarship Winner ............................ 22 Peter Hewitt Hare (1935-2008) ....................................... 6 People Who Made It Possible ............................................... 22 Kenneth Barber (1940-2008) ............................................ 7 The Peter Hare Award ........................................................ 22 Kenneth K. Inada (1924-2011) ......................................... 7 The Hourani Lectures ......................................................... 23 Faculty Updates .............................................................................. 8 The Steinberg Award........................................................... 25 Introducing David Braun ...................................................... 8 The Romanell Award ........................................................... 25 Introducing Richard Cohen ................................................. 8 The Perry Award ..................................................................