Bimbo K. (Ed.) J. Michael Dunn on Information Based Logics (OCL008
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Outstanding Contributions to Logic
Outstanding Contributions to Logic Volume 8 Editor-in-chief Sven Ove Hansson, Royal Institute of Technology, Stockholm, Sweden Editorial Board Marcus Kracht, Universität Bielefeld Lawrence Moss, Indiana University Sonja Smets, Universiteit van Amsterdam Heinrich Wansing, Ruhr-Universität Bochum More information about this series at http://www.springer.com/series/10033 Katalin Bimbó Editor J. Michael Dunn on Information Based Logics 123 Editor Katalin Bimbó Department of Philosophy University of Alberta Edmonton, AB Canada ISSN 2211-2758 ISSN 2211-2766 (electronic) Outstanding Contributions to Logic ISBN 978-3-319-29298-4 ISBN 978-3-319-29300-4 (eBook) DOI 10.1007/978-3-319-29300-4 Library of Congress Control Number: 2016930054 © Springer International Publishing Switzerland 2016 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. -
The Proscriptive Principle and Logics of Analytic Implication
City University of New York (CUNY) CUNY Academic Works All Dissertations, Theses, and Capstone Projects Dissertations, Theses, and Capstone Projects 2-2017 The Proscriptive Principle and Logics of Analytic Implication Thomas M. Ferguson The Graduate Center, City University of New York How does access to this work benefit ou?y Let us know! More information about this work at: https://academicworks.cuny.edu/gc_etds/1882 Discover additional works at: https://academicworks.cuny.edu This work is made publicly available by the City University of New York (CUNY). Contact: [email protected] The Proscriptive Principle and Logics of Analytic Implication by Thomas Macaulay Ferguson A dissertation submitted to the Graduate Faculty in Philosophy in partial fulfillment of the requirements for the degree of Doctor of Philosophy, The City University of New York 2017 ii © 2017 Thomas Macaulay Ferguson All Rights Reserved iii This manuscript has been read and accepted by the Graduate Faculty in Philosophy in satisfaction of the dissertation requirement for the degree of Doctor of Philosophy. Professor Sergei Artemov Date Chair of Examining Committee Professor Iakovos Vasiliou Date Executive Officer Professor Graham Priest Professor Heinrich Wansing Professor Kit Fine Supervisory Committee The City University of New York iv Abstract The Proscriptive Principle and Logics of Analytic Implication by Thomas Macaulay Ferguson Adviser: Professor Graham Priest The analogy between inference and mereological containment goes at least back to Aristotle, whose discussion in the Prior Analytics motivates the validity of the syllogism by way of talk of parts and wholes. On this picture, the application of syllogistic is merely the anal- ysis of concepts, a term that presupposes—through the root ἀνά + λύω —a mereological background. -
The Prehistory of the Subsystems of Second-Order Arithmetic
The Prehistory of the Subsystems of Second-Order Arithmetic Walter Dean* and Sean Walsh** December 19, 2016 Abstract This paper presents a systematic study of the prehistory of the traditional subsys- tems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar´eto Feferman as concerns arithmetic definability and provability, (ii) the in- terplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak K¨onig'sLemma, and (iv) the large-scale intellectual backdrop to arithmetical transfinite recursion in descriptive set theory and its effec- tivization by Borel, Lusin, Addison, and others. * Department of Philosophy, University of Warwick, Coventry, CV4 7AL, United Kingdom, E-mail: [email protected] **Department of Logic and Philosophy of Science, 5100 Social Science Plaza, University of California, Irvine, Irvine, CA 92697-5100, U.S.A., E-mail: [email protected] or [email protected] 1 Contents 1 Introduction3 2 Arithmetical comprehension and related systems5 2.1 Russell, Poincar´e,Zermelo, and Weyl on set existence . .5 2.2 Grzegorczyk, Mostowski, and Kond^oon effective analysis . .7 2.3 Kreisel on predicative definability . .9 2.4 Kreisel, Wang, and Feferman on predicative provability . 10 2.5 ACA0 as a formal system . 11 3 Hilbert and Bernays, the Grundlagen der Mathematik, and recursive com- prehension 13 3.1 From the Axiom of Reducibility to second-order arithmetic . -
The Prehistory of the Subsystems of Second-Order Arithmetic Arxiv
The Prehistory of the Subsystems of Second-Order Arithmetic Walter Dean* and Sean Walsh** December 20, 2016 Abstract This paper presents a systematic study of the prehistory of the traditional subsys- tems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar´eto Feferman as concerns arithmetic definability and provability, (ii) the in- terplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak K¨onig'sLemma, and (iv) the large-scale intellectual backdrop to arithmetical transfinite recursion in descriptive set theory and its effec- tivization by Borel, Lusin, Addison, and others. arXiv:1612.06219v1 [math.HO] 19 Dec 2016 * Department of Philosophy, University of Warwick, Coventry, CV4 7AL, United Kingdom, E-mail: [email protected] **Department of Logic and Philosophy of Science, 5100 Social Science Plaza, University of California, Irvine, Irvine, CA 92697-5100, U.S.A., E-mail: [email protected] or [email protected] 1 Contents 1 Introduction3 2 Arithmetical comprehension and related systems5 2.1 Russell, Poincar´e,Zermelo, and Weyl on set existence . .5 2.2 Grzegorczyk, Mostowski, and Kond^oon effective analysis . .7 2.3 Kreisel on predicative definability . .9 2.4 Kreisel, Wang, and Feferman on predicative provability . 10 2.5 ACA0 as a formal system . 11 3 Hilbert and Bernays, the Grundlagen der Mathematik, and recursive com- prehension 13 3.1 From the Axiom of Reducibility to second-order arithmetic . -
An Engineer in Philosopher's Clothing
An Engineer in Philosopher’s Clothing I am convinced that the act of thinking logically cannot possibly be natural to the human mind. If it were, then mathematics would be everybody’s easiest course at school and our species would not have taken several millennia to figure out the scientific method. —Neil deGrasse Tyson, The Sky is Not the Limit: Adventures of an Urban Astrophysicist David Brooks, the NY Times columnist, has recently made the distinction between “résumé virtues” and “obituary virtues,” saying that the résumé virtues are the skills you bring to the marketplace, whereas the eulogy virtues are the ones that are talked about at your funeral.1 This autobiography is neither a resume nor an obituary, since I am at a point in my life when (I hope) neither is appropriate. Also since I am a Midwesterner, I am supposed to be humble (as fans of Garrison Keillor’s Lake Wobegon will know). But I will do the best I can to tell an interesting story, which I confess will mean bragging, at least a little, about my virtues of both kinds. I will also do a lot of name dropping, because this is my opportunity to in effect thank a lot of people for their support. I of course will accidentally overlook somebody, and if that somebody is you, I deeply apologize. I will also use this “autobio” a bit as a bully pulpit, to share with you my developing views about logic. The introductory quote from Neil deGrasse Tyson is very relevant to these views. -
Relevance Logic: Problems Open and Closed
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Open Journal Systems at the Victoria University of Wellington Library Australasian Journal of Logic Relevance Logic: Problems Open and Closed Alasdair Urquhart Department of Computer Science University of Toronto ∗ January 22, 2016 Abstract I discuss a collection of problems in relevance logic. The main prob- lems discussed are: the decidability of the positive semilattice system, decidability of the fragments of R in a restricted number of variables, and the complexity of the decision problem for the implicational fragment of R. Some related problems are discussed along the way. 1 Introduction This paper is a lightly edited version of a talk presented at the Summer of Logic in Vienna in July 2014. The aim of the talk was to present a handful of unsolved problems in the area of relevance logic, as well as to report the very recent solution of a long-standing open problem. The selection obviously reflects my own interests; I encourage other researchers to present their own favourite problems. If the health of an area of logic is to be judged by continued activity surrounding open problems, then relevance logic must be accounted a flourishing area! The relevance logic tradition, starting with Ackermann and continuing with the work of Alan Ross Anderson, Nuel D. Belnap and their students, has nur- tured a fascinating collection of open problems that have stimulated research in the area for decades. Anderson provided an early collection of open problems in a paper [3] from 1963.