DOCSLIB.ORG

Solomon Feferman Papers SC0907

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Solomon Feferman Papers SC0907 http://oac.cdlib.org/findaid/ark:/13030/kt7n39s5bv Online items available Guide to the Solomon Feferman papers SC0907 Daniel Hartwig & Jenny Johnson Department of Special Collections and University Archives October 2010 Green Library 557 Escondido Mall Stanford 94305-6064 [email protected] URL: http://library.stanford.edu/spc Note This encoded finding aid is compliant with Stanford EAD Best Practice Guidelines, Version 1.0. Guide to the Solomon Feferman SC0907 1 papers SC0907 Language of Material: English Contributing Institution: Department of Special Collections and University Archives Title: Solomon Feferman papers creator: Feferman, Solomon. Identifier/Call Number: SC0907 Physical Description: 28.75 Linear Feet Date (inclusive): 1938-2016 Date (bulk): bulk Abstract: The first series primarily document Feferman’s term as president of the Association for Symbolic Logic from 1980 to 1982. The material consists largely of correspondence, meeting agendas and minutes, and material from symposia and lectures. Accession 2018-045 largely consists of correspondence, publications and talks, Stanford University Mathematics Department material, and other professional material. Information about Access This collection is open for research. Ownership & Copyright All requests to reproduce, publish, quote from, or otherwise use collection materials must be submitted in writing to the Head of Special Collections and University Archives, Stanford University Libraries, Stanford, California 94304-6064. Consent is given on behalf of Special Collections as the owner of the physical items and is not intended to include or imply permission from the copyright owner. Such permission must be obtained from the copyright owner, heir(s) or assigns. See: http://library.stanford.edu/depts/spc/pubserv/permissions.html. Restrictions also apply to digital representations of the original materials. Use of digital files is restricted to research and educational purposes. Cite As Solomon Feferman Papers (SC0907). Department of Special Collections and University Archives, Stanford University Libraries, Stanford, Calif. Biographical/Historical Sketch Solomon Feferman was a Professor of Mathematics and Philosophy and the Patrick Suppes Family Professor of Humanities and Sciences at Stanford University, he became Emeritus in 2004. Born December 13, 1928 in New York, New York, Feferman earned a B.S. from the California Institute of Technology in 1948, and his Ph.D. at University of California, Berkeley in 1957. His interests included mathematical logic, philosophy of mathematics, and history modern logic. Feferman died in 2016. Description of the Collection These papers primarily document Feferman’s term as president of the Association for Symbolic Logic from 1980 to 1982. The material consists largely of correspondence, meeting agendas and minutes, and material from symposia and lectures. Accession 2018-045 largely consists of correspondence, publications and talks, Stanford University Mathematics Department material, and other professional material. Subjects and Indexing Terms Logic, Symbolic and Mathematical. Association for Symbolic Logic. Feferman, Solomon. Feferman, Solomon. Feferman, Solomon. Stanford University. Department of Mathematics Papers Accession ARCH-2008-227 box 1, folder 1 Association for Symbolic Logic (ASL) Book Series Folder, 1981-1982 box 1, folder 2 ASL Book Series Proposal (1 of 2), 1980-1983 box 1, folder 3 ASL Book Series Proposal (2 of 2), 1980-1983 box 1, folder 4 Book Series Extra Letters, 1981 box 1, folder 5 ASL Membership Committee, 1977-1982 Guide to the Solomon Feferman SC0907 2 papers SC0907 Papers Accession ARCH-2008-227 box 1, folder 6 Journal of Symbolic Logic (JSL) Current, 1982 box 1, folder 7 Agenda Work-Up & Memos from Mesiro, 1981-1983 box 1, folder 8 ASL Book series-Boston, 1982-1983 box 1, folder 9 AMS/ASL Translations Subcommittee, 1980-1982 box 1, folder 10 ASL Meeting-Boston December 29, 1983, 1982-1983 box 1, folder 11 ASL: Editorial Board- Abstracts Format, 1980-1982 box 1, folder 12 European Committee for Logic, 1980-1982 box 1, folder 13 ASL Prize & Awards, 1978-1982 box 1, folder 14 Broadening-Letters to the Council, 1982 box 2, folder 1 Interned Polish Logicians, 1981-1982 box 2, folder 2 Proposal: Latin American Symposium, 1982-1983 box 2, folder 3 Broadening the ASL- Center Meeting; May 12, 1982, 1980-1982 box 2, folder 4 IUHPS/DLMPS-Salzburg Meeting, 1983 box 2, folder 5 ASL (Active)-Pending, 1978-1979 box 2, folder 6 Main Files, 1978-1979 box 2, folder 7 ASL Publications Committee: Subcommittee I- New Journals, 1973- box 2, folder 8 ASL-Bulletin of Information, 1980-1981 box 2, folder 9 ASL-Bulletin of Information II, 1983 box 2, folder 10 ASL Council Minutes, 1983 January 7-8 box 2, folder 11 ASL-Correspondence, 1982 box 3, folder 1 ASL,1981-1982 box 3, folder 2 Ruth Barcan Marcus-Correspondence, 1982-1983 box 3, folder 3 ASL New Business,1983 box 3, folder 4 NSF Travel Grant to Salzburg Meeting, 1982 box 3, folder 5 ASL-Final Work, 1981-1983 box 3, folder 6 ASL Correspondence (II), 1982-1983 box 3, folder 7 ASL Correspondence (III), 1982-1983 box 3, folder 8 ASL-Council Meeting, 1983 December 29-30 box 3, folder 9 ASL-Meeting in Anaheim-Council Meeting Agenda, 1985 January box 3, folder 10 ASL-Nominations, 1985 Additional Papers Accession ARCH-2018-045 Publications Talks box 1, folder 1 Typical Ambiguity: Trying to have your cake and eat it too box 1, folder 2 Typical Ambiguity box 1, folder 3 Category Theory In Explicit Maths. "Collections approach" box 1, folder 4 Prospectus Chapters 1, 2, 3 Vienna Talks Photos Tarnshi Potrait box 1, folder 5 Lukasiewicz Correspondence 1948-1951 box 1, folder 6 Tarshi-Some e-email responses box 1, folder 7 Tarski: ABC Lists box 1, folder 8 Tarski Database box 1, folder 9 Foundations of Explicit Maths. Chapters in papers 211-212 box 1, folder 10 Foundations of Explicit Mathematics Chapters 8-10 Plus outlines Chapters 11-19 and end material 212 Jul 2 box 1, folder 11 Foundations of Explicit Mathmatics Chapters 1-4, 6-7 and Suggestion revisions Chapters 1-4, 6-7 212 Jun 13, 212 Jun 30 box 1, folder 12 Foundation of Explicit Mathematics Contents box 1, folder 13 Computation and Recurrsion box 1, folder 14 Notes for Chapter 2 "Fixing Frege" by John Bungers box 1, folder 15 Preface / Papers box 1, folder 16 Conviction and Caution-Responses box 1, folder 17 Conviction and Caution-Original + Comments box 1, folder 18 Tausshey-Todd / Meuger / Koehler box 1, folder 19 Godel 1931C box 1, folder 20 Type Symbols for YK 1931C box 1, folder 21 Papers + Refs Guide to the Solomon Feferman SC0907 3 papers SC0907 Additional Papers Accession ARCH-2018-045 Publications Talks box 1, folder 22 Godel-Life and Work-Responses box 1, folder 23 Commentaries on my chapter Godel Life and Word box 1, folder 24 Godel Life-Notes box 1, folder 25 Godel Biography-Early Version box 1, folder 26 Godel: Conviction and Caution [Final Version] + Bales, Gaudjean letter box 1, folder 27 Proof Theory Symposium + "Some formal systems for the unlimted theory of structures and categories" 1974 box 1, folder 28 The explicit content of actual mathmatical analysis: formal systems of analysis and their interpretations (outline of proposed book) 1973 box 1, folder 29 Cleramont-Fernand Tutorials 1994 Jul box 1, folder 30 Logical Founds. Of Sci. Applic. Maths. (Transparencies) box 1, folder 31 Quine Memorial Symposium 201 Jan 26 box 1, folder 32 Quine Transparencies box 1, folder 33 Lectures, Transparencies "Does Mathmatics Need New Axioms?" box 1, folder 34 Logic Colloquium-Talk Transparencies "Functionary inductively presented topics" 1988 box 1, folder 35 Tarski Conference Warsaw-Russel; Paradox Conference, Munnich May 28-Jun 1, Jun 2-5 box 1, folder 36 UC Irvine Lecture: In the light of logic Godel and Tarski-Transparencies 1999 Oct 19-22 box 1, folder 37 Hilbert's Program Symposium 1985 Dec 29 box 1, folder 38 Austin Talk" Personal Shopping List for logical frameworks--tranparencies 1993 Feb 5 box 1, folder 39 UC Irvine visit 1999 Oct 18-23 box 1, folder 40 From Problem Driven Logic to Use Driven Logic box 1, folder 41 Comments on Encylopedia Iraliara Article on Foundations of Programs box 1, folder 42 A Miscellany of Mathematical-Philosophical Quotations for Janet Lewis Winters 90th BIrthday 1989 Aug 17 box 1, folder 43 To a framework for polymorphinism-lecture transparencies 1996 Nov-1987 Feb box 1, folder 44 Browwer Meet 1981 Jun 7-13 box 1, folder 45 McCarthy Photos box 1, folder 46 Meetups/People-Personal box 1, folder 47 Metamath Lecture Notes 1-15 1961-1962 box 1, folder 48 Folder for Finished Notes: Metamath Course Lecture Notes 16-29 1961-1962 box 1, folder 49 Godel and 20th Century Logic-History of Science Lecture 1989 box 1, folder 50 Inaugrual Lecture Stanford / Colloquim San Jose / "Deciding the undecided" Transparencies 1994 Feb 13, 1994 Sep 22 box 3, folder 1 Meetings 2000-2001 box 3, folder 2 Ondimals-Notes and papers to take box 3, folder 3 Conservation results for theories with choice and comprehension princniple box 3, folder 4 Assorted Proof Theory Notes Atrp-higs box 3, folder 5 Columbia Papers box 3, folder 6 291A box 3, folder 7 "Some theories of strepth" Lecture-Patras Logic Colloquium 1980 box 3, folder 8 Feferman ATR 2017 Dec 2 box 3, folder 9 Lecture on Set Theory 1978 box 3, folder 10 Set Theory Notes box 3, folder 11 Set Theory Math 292B Notes 1993-1994 box 3, folder 12 Set Theory Math 292A Notes 1993-1994 box 3, folder 13 Phil 162 Philosophy of Mathematics box 3, folder 14 Logic Societies Groups Newsletters, Info, Emails box 3, folder 15 Book Shetehan for analysis misc. box 3, folder 16 Math 294 Section Notes box 3, folder 17 AC vs CA in Subsystems of Analysis box 3, folder 18 Work.
Load more

Recommended publications
  • “The Church-Turing “Thesis” As a Special Corollary of Gödel's
    “The Church-Turing “Thesis” as a Special Corollary of Gödel’s Completeness Theorem,” in Computability: Turing, Gödel, Church, and Beyond, B. J. Copeland, C. Posy, and O. Shagrir (eds.), MIT Press (Cambridge), 2013, pp. 77-104. Saul A. Kripke This is the published version of the book chapter indicated above, which can be obtained from the publisher at https://mitpress.mit.edu/books/computability. It is reproduced here by permission of the publisher who holds the copyright. © The MIT Press The Church-Turing “ Thesis ” as a Special Corollary of G ö del ’ s 4 Completeness Theorem 1 Saul A. Kripke Traditionally, many writers, following Kleene (1952) , thought of the Church-Turing thesis as unprovable by its nature but having various strong arguments in its favor, including Turing ’ s analysis of human computation. More recently, the beauty, power, and obvious fundamental importance of this analysis — what Turing (1936) calls “ argument I ” — has led some writers to give an almost exclusive emphasis on this argument as the unique justification for the Church-Turing thesis. In this chapter I advocate an alternative justification, essentially presupposed by Turing himself in what he calls “ argument II. ” The idea is that computation is a special form of math- ematical deduction. Assuming the steps of the deduction can be stated in a first- order language, the Church-Turing thesis follows as a special case of G ö del ’ s completeness theorem (first-order algorithm theorem). I propose this idea as an alternative foundation for the Church-Turing thesis, both for human and machine computation. Clearly the relevant assumptions are justified for computations pres- ently known.
    [Show full text]
  • Unfolding of Systems of Inductive Definitions
    UNFOLDINGOFSYSTEMSOFINDUCTIVE DEFINITIONS A DISSERTATION SUBMITTED TO THE DEPARTMENT OF MATHEMATICS AND THE COMMITTEE OF GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FORTHEDEGREEOF DOCTOROFPHILOSOPHY Ulrik Torben Buchholtz December 2013 © 2013 by Ulrik Torben Buchholtz. All Rights Reserved This work is licensed under the Creative Commons Attribution 3.0 United States License. To view a copy of this license, visit http://creativecommons.org/licenses/by/3.0/us/ or send a letter to Creative Commons, 444 Castro Street, Suite 900, Mountain View, California, 94041, USA. This dissertation is online at: http://purl.stanford.edu/kg627pm6592 ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Solomon Feferman, Primary Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Grigori Mints, Co-Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Thomas Strahm Approved for the Stanford University Committee on Graduate Studies. Patricia J. Gumport, Vice Provost for Graduate Education An original signed hard copy of the signature page is on file in University Archives. iii iv ABSTRACT This thesis is a contribution to Solomon Feferman’s Unfolding Program which aims to provide a general method of capturing the operations on individuals and predicates (and the principles governing them) that are implicit in a formal axiomatic system based on open-ended schemata.
    [Show full text]
  • Notices of the American Mathematical Society
    June 18 and 19)- Page 341 Vl 0 ~ Mathematical Society Calendar of AMS Meetings THIS CALENDAR lists all meetings which have been approved by the Council prior to the date this issue of the Notices was sent to press. The summer and annual meetings are joint meetings of the Mathematical Association of America and the Ameri· can Mathematical Society. The meeting dates which fall rather far in the future are subject to change; this is particularly true of meetings to which no numbers have yet been assigned. Programs of the meetings will appear in the issues indicated below. First and second announcements of the meetings will have appeared in earlier issues. ABSTRACTS OF PAPERS presented at a meeting of the Society are published in the journal Abstracts of papers presented to the American Mathematical Society in the issue corresponding to that of the Notices which contains the program of the meet­ ing. Abstracts should be submitted on special forms which are available in many departments of mathematics and from the office of the Society in Providence. Abstracts of papers to be presented at the meeting must be received at the headquarters of the Society in Providence, Rhode Island, on or before the deadline given below for the meeting. Note that the deadline for ab· stracts submitted for consideration for presentation at special sessions is usually three weeks earlier than that specified below. For additional information consult the meeting announcement and the list of organizers of special sessions. MEETING ABSTRACT NUMBER DATE PLACE DEADLINE
    [Show full text]
  • Proof Theory Synthese Library
    PROOF THEORY SYNTHESE LIBRARY STUDIES IN EPISTEMOLOGY, LOGIC, METHODOLOGY, AND PHILOSOPHY OF SCIENCE Managing Editor: JAAKKO HINTIKKA, Boston University Editors: DIRK VAN DALEN, University of Utrecht, The Netherlands DONALD DAVIDSON, University of California, Berkeley THEO A.F. KUIPERS, University of Groningen, The Netherlands PATRICK SUPPES, Stanford University, California JAN WOLENSKI, iagiellonian University, Krakow, Poland VOLUME 292 PROOF THEORY History and Philosophical Significance Edited by VINCENT F. HENDRICKS University of Copenhagen. Denmark STIG ANDUR PEDERSEN and KLAUS FROVIN J0RGENSEN University of Roskilde, Denmark SPRINGER-SCIENCE+BUSINESS MEDIA, B.V. A c.I.P. Catalogue record for this book is available from the Library of Congress. ISBN 978-90-481-5553-8 ISBN 978-94-017-2796-9 (eBook) DOI 10.1007/978-94-017-2796-9 Printed on acid-free paper All Rights Reserved © 2000 Springer Science+Business Media Dordrecht Originally published by Kluwer Academic Publishers in 2000 Softcover reprint of the hardcover 1st edition 2000 No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without written permission from the copyright owner. CONTENTS Preface ................................................................. ix Contributing Authors ................................................. , xi HENDRICKS, PEDERSEN AND J0RGENSEN / Introduction .......... 1 PART 1. REVIEW OF PROOF THEORY SOLOMON FEFERMAN / Highlights in Proof Theory ................ , 11 1. Review of Hilbert's Program and Finitary Proof Theory ......... , 11 2. Results of Finitary Proof Theory via Gentzen's L-Calculi ......... 14 3. Shifting Paradigms .............................................. 21 4. Countably Infinitary Methods (Getting the Most Out of Logic) ..
    [Show full text]
  • An Interview with Martin Davis
    Notices of the American Mathematical Society ISSN 0002-9920 ABCD springer.com New and Noteworthy from Springer Geometry Ramanujan‘s Lost Notebook An Introduction to Mathematical of the American Mathematical Society Selected Topics in Plane and Solid Part II Cryptography May 2008 Volume 55, Number 5 Geometry G. E. Andrews, Penn State University, University J. Hoffstein, J. Pipher, J. Silverman, Brown J. Aarts, Delft University of Technology, Park, PA, USA; B. C. Berndt, University of Illinois University, Providence, RI, USA Mediamatics, The Netherlands at Urbana, IL, USA This self-contained introduction to modern This is a book on Euclidean geometry that covers The “lost notebook” contains considerable cryptography emphasizes the mathematics the standard material in a completely new way, material on mock theta functions—undoubtedly behind the theory of public key cryptosystems while also introducing a number of new topics emanating from the last year of Ramanujan’s life. and digital signature schemes. The book focuses Interview with Martin Davis that would be suitable as a junior-senior level It should be emphasized that the material on on these key topics while developing the undergraduate textbook. The author does not mock theta functions is perhaps Ramanujan’s mathematical tools needed for the construction page 560 begin in the traditional manner with abstract deepest work more than half of the material in and security analysis of diverse cryptosystems. geometric axioms. Instead, he assumes the real the book is on q- series, including mock theta Only basic linear algebra is required of the numbers, and begins his treatment by functions; the remaining part deals with theta reader; techniques from algebra, number theory, introducing such modern concepts as a metric function identities, modular equations, and probability are introduced and developed as space, vector space notation, and groups, and incomplete elliptic integrals of the first kind and required.
    [Show full text]
  • PREFACE Does God Have a Big Toe? (Pages 1 - 13)
    PREFACE Does God have a Big TOE? We are called to be in the world. Not of it. But not out of it, either.1 This book holds the mirror to a single paradox: We must live the historical moment we are in without letting that moment explain us. Christianity must bring to every culture an indigenous faith that is true to its heritage without Christianity’s becoming a culture faith. If every book has one idea, this is it for the one you are reading. The cardinal sin for modernity has been antiintellectualism, a dissenting spirit against celebrating the powers of the mind that has gripped large segments of the Christian church. The sin governing much of the church today may be ahistoricalism or antihistoricalism. Large segments of the Christian community, finding the intellectual and social company of modernism more congenial than that of postmodernism, are in retreat, having disconnected from the unprecedented, restructuring changes taking place all around them. The Christian mind is failing to comprehend the times, our times. The New Light apologetic chronicled in this book is devoted to enfranchising and energizing Christians to connect their faith with the indigenous historical place in which God has chosen them to live. It aims to jolt Christians into a sense of their own time, out of their fashionable out-of-itness. For the God who exists beyond time is the God who lives, moves, and has being in this time. The ultimate hospitality is, then, an entertainment of divine mystery in human life. Benedictine/biblical scholar Demetrius R.
    [Show full text]
  • Plausibility and Probability in Deductive Reasoning
    Plausibility and probability in deductive reasoning Andrew MacFie∗ Abstract We consider the problem of rational uncertainty about unproven mathe- matical statements, remarked on by Gödel and others. Using Bayesian-inspired arguments we build a normative model of fair bets under deductive uncertainty which draws from both probability and the theory of algorithms. We comment on connections to Zeilberger’s notion of “semi-rigorous proofs”, particularly that inherent subjectivity would be present. We also discuss a financial view with models of arbitrage where traders have limited computational resources. Contents 1 A natural problem: Quantified deductive uncertainty 2 1.1 Thephenomenon ......................... 2 1.2 The(modeling)problem . .. .. 3 2 Formal representation of plausibilities 4 2.1 Plausibility functions . 4 2.2 Languages............................. 5 2.3 Epistemic quality vs. computation costs . 5 2.4 Conditional plausibility . 7 3 Rational plausibilities in mathematics 7 3.1 Scoringrules............................. 7 3.2 Foundationsof“semi-rigorous proofs” . 8 arXiv:1708.09032v6 [cs.AI] 16 Dec 2019 4 Arbitrage pricing in markets with computational constraints 10 5 Conclusion 11 References 11 ∗School of Mathematics and Statistics, Carleton University. This work was done in part while the author was a visitor at the Harvard John A. Paulson School of Engineering and Applied Sciences. 1 1 A natural problem: Quantified deductive uncertainty 1.1 The phenomenon Epistemic uncertainty is usually defined as uncertainty among physical states due to lack of data or information. By information we mean facts which we observe from the external world. For example, whether it rains tomorrow is a piece of information we have not observed, so we are uncertain about its truth value.
    [Show full text]
  • Theses for Computation and Recursion on Concrete and Abstract Structures
    Theses for Computation and Recursion on Concrete and Abstract Structures Solomon Feferman Abstract: The main aim of this article is to examine proposed theses for computation and recursion on concrete and abstract structures. What is generally referred to as Church’s Thesis or the Church-Turing Thesis (abbreviated CT here) must be restricted to concrete structures whose objects are finite symbolic configurations of one sort or another. Informal and principled arguments for CT on concrete structures are reviewed. Next, it is argued that proposed generalizations of notions of computation to abstract structures must be considered instead under the general notion of algorithm. However, there is no clear general thesis in sight for that comparable to CT, though there are certain wide classes of algorithms for which plausible theses can be stated. The article concludes with a proposed thesis RT for recursion on abstract structures. 1. Introduction. The concepts of recursion and computation were closely intertwined from the beginning of the efforts early in the 1930s to obtain a conceptual analysis of the informal notion of effective calculability. I provide a review of those efforts in sec. 2 as background to the remainder of this article, but I have nothing new to add here to the extensive historical and analytical literature.1 It is generally agreed that the conceptual analysis of effective calculability was first provided most convincingly by Turing (1936- 7). Not long before that Church (1936) had proposed identifying effective calculability with the Herbrand-Gödel notion of general recursiveness, soon enough proved equivalent to Turing computability among other suggested explications.
    [Show full text]
  • Representations in Measure Theory: Between a Non-Computable Rock
    REPRESENTATIONS IN MEASURE THEORY: BETWEEN A NON-COMPUTABLE ROCK AND A HARD TO PROVE PLACE DAG NORMANN AND SAM SANDERS Abstract. The development of measure theory in ‘computational’ frame- works proceeds by studying the computational properties of countable approx- imations of measurable objects. At the most basic level, these representations are provided by Littlewood’s three principles, and the associated approxima- tion theorems due to e.g. Lusin and Egorov. In light of this fundamental role, it is then a natural question how hard it is to prove the aforementioned theorems (in the sense of the Reverse Mathematics program), and how hard it is to com- pute the countable approximations therein (in the sense of Kleene’s schemes S1-S9). The answer to both questions is ‘extremely hard’, as follows: one one hand, proofs of these approximation theorems require weak compactness, the measure-theoretical principle underlying e.g. Vitali’s covering theorem. In terms of the usual scale of comprehension axioms, weak compactness is only provable using full second-order arithmetic. On the other hand, computing the associated approximations requires a weak fan functional Λ, which is a realiser for weak compactness and is only computable from (a certain comprehension functional for) full second-order arithmetic. Despite this observed hardness, we show that weak compactness, and certain weak fan functionals, behave much better than (Heine-Borel) compactness and the associated class of realisers, called special fan functionals Θ. In particular, we show that the combina- tion of any Λ-functional and the Suslin functional has no more computational power than the latter functional alone, in contrast to Θ-functionals.
    [Show full text]
  • 1 Axioms for Determinateness and Truth Solomon Feferman Abstract A
    Axioms for determinateness and truth Solomon Feferman Abstract A new formal theory DT of truth extending PA is introduced, whose language is that of PA together with one new unary predicate symbol T(x), for truth applied to Gödel numbers of suitable sentences in the extended language. Falsity of x, F(x), is defined as truth of the negation of x; then the formula D(x) expressing that x is the number of a determinate meaningful sentence is defined as the disjunction of T(x) and F(x). The axioms of DT are those of PA extended by (I) full induction, (II) strong compositionality axioms for D, and (III) the recursive defining axioms for T relative to D. By (II) is meant that a sentence satisfies D if and only if all its parts satisfy D; this holds in a slightly modified form for conditional sentences. The main result is that DT has a standard model. As an improvement over earlier systems developed by the author, DT meets a number of leading criteria for formal theories of truth that have been proposed in the recent literature, and comes closer to realizing the informal view that the domain of the truth predicate consists exactly of the determinate meaningful sentences. 1. Background Much work has been devoted since the 1970s to breaking the binds of Tarskian hierarchies for truth. There are two basic approaches to non-hierarchical theories of truth, semantical and axiomatic. Work as of the early 1990s on both of these was usefully surveyed by Michael Sheard (1994), and as far as I know there has been no comparable canvass of the two approaches that would bring us up to date on the progress that has been made in the intervening years.
    [Show full text]
  • Philosophy of Mathematics in the Twentieth Century: Selected Essays
    Philosophy of Mathematics in the Twentieth Century: Selected Essays. CHARLES PARSONS. Cambridge: Harvard University Press, 2014. xiv + 350 pp. $55.00 £40.50 €49.50 (Hardcover). ISBN 978-0-67472806-6. © 2014 JOHN P. BURGESS The second volume of Charles Parsons’ selected papers, dedicated to Solomon Feferman, Wilfred Sieg, and William Tait, collects eleven mainly historical essays and reviews on philosophy and philosophers of mathematics in the last century, with about 15% new material, including: one new thematic essay on the continuing Kantian legacy in the first half of the century (in the usual suspects, intuitionist and formalist), forming a link of sorts with the predecessor volume, From Kant to Husserl (Harvard, 2012); postscripts to several papers; new notes; and an introduction and preface. A second thematic essay concerns the relationship, again in the first half of the century, between acceptance of impredicative definitions and philosophical realism, finding it more complicated than usually supposed (even though the issue of impredicativity in intuitionism, from the Brouwer- Heyting-Kolmogorov explanation of the conditional to the “creative subject” scheme is not covered), partly because of Hilbert’s acceptance of impredicativity in mathematical practice, as legitimate though not inhaltlich. The remaining ten papers treat the philosophies of mathematics of six important writers and thinkers: two logicians with institutional affiliations in mathematics (Paul Bernays and Kurt Gödel), two logicians with institutional affiliations in philosophy (Hao Wang and William Tait), and two philosophers who made significant contributions to logic, especially early in their careers (W. V. O. Quine and Hilary Putnam), to which category Parsons himself belongs, though he is also what none of the others are, an historian of philosophy.
    [Show full text]
  • Axiomatic Set Theory Proceedings of Symposia in Pure Mathematics
    http://dx.doi.org/10.1090/pspum/013.2 AXIOMATIC SET THEORY PROCEEDINGS OF SYMPOSIA IN PURE MATHEMATICS VOLUME XIII, PART II AXIOMATIC SET THEORY AMERICAN MATHEMATICAL SOCIETY PROVIDENCE, RHODE ISLAND 1974 PROCEEDINGS OF THE SYMPOSIUM IN PURE MATHEMATICS OF THE AMERICAN MATHEMATICAL SOCIETY HELD AT THE UNIVERSITY OF CALIFORNIA LOS ANGELES, CALIFORNIA JULY 10-AUGUST 5, 1967 EDITED BY THOMAS J. JECH Prepared by the American Mathematical Society with the partial support of National Science Foundation Grant GP-6698 Library of Congress Cataloging in Publication Data Symposium in Pure Mathematics, University of California, DDE Los Angeles, 1967. Axiomatic set theory. The papers in pt. 1 of the proceedings represent revised and generally more detailed versions of the lec• tures. Pt. 2 edited by T. J. Jech. Includes bibliographical references. 1. Axiomatic set theory-Congresses. I. Scott, Dana S. ed. II. Jech, Thomas J., ed. HI. Title. IV. Series. QA248.S95 1967 51l'.3 78-125172 ISBN 0-8218-0246-1 (v. 2) AMS (MOS) subject classifications (1970). Primary 02K99; Secondary 04-00 Copyright © 1974 by the American Mathematical Society Printed in the United States of America All rights reserved except those granted to the United States Government. This book may not be reproduced in any form without the permission of the publishers. CONTENTS Foreword vii Current problems in descriptive set theory 1 J. W. ADDISON Predicatively reducible systems of set theory 11 SOLOMON FEFERMAN Elementary embeddings of models of set-theory and certain subtheories 3 3 HAIM GAIFMAN Set-theoretic functions for elementary syntax 103 R. O. GANDY Second-order cardinal characterizability 127 STEPHEN J.
    [Show full text]