Symposium: L.E.J. Brouwer, Fifty Years Later. Free Choice Sequences: A Temporal Interpretation Compatible with Acceptance of Classical Mathematics
|
|
- Rodney Hunter
- 5 years ago
- Views:
Transcription
1 Symposium: L.E.J. Brouwer, Fifty Years Later Amsterdam December 9 th, 2016 Free Choice Sequences: A Temporal Interpretation Compatible with Acceptance of Classical Mathematics Saul A. Kripke CUNY Graduate Center Saul Kripke Center
2 Brouwer s intuitionism had various features and motivations. The most important one was the rejection of nonconstructive arguments, which, according to him, necessitated a new interpretation of the (syntactic) logical constants. Most famously: the interpretations of disjunction and negation, which implied a rejection of the law of excluded middle. Also, of course, the constructive interpretation of existential quantification: denying that an existential statement can be made without in principle being able to provide an instance.
3 Eventually, though this took time, most mathematicians simply ignored the Brouwerian criticisms and developed classical mathematics as before. But there was a time when this was a very live issue. (As everyone here knows, in spite of his own position, Brouwer himself did famous work that was only classically valid.) And interest in intuitionism is alive for many of us here, even if we do not reject classical mathematics.
4 Another feature of Brouwer s work came later. In addition to the determinate or lawlike sequences, he proposed that free choice sequences be allowed. As Heyting says, one does not really need to suppose that an infinitely proceeding sequence be determined by a law: The question how the components of the sequence are successively determined, whether by a law, by free choices, by throwing a die, or by some other means, is entirely irrelevant. (Intuitionism, an Introduction,1956: 32)
5 This newer aspect of his work has a more difficult history. Errett Bishop, a relatively late admirer of Brouwer s constructivism and of his work, categorically rejected the notion of a free choice sequence. He says: In Brouwer s case there seems to have been a nagging suspicion that unless he personally intervened to prevent it the continuum would turn out to be discrete. He therefore introduced the method of free-choice sequences for constructing the continuum, as a consequence of which the continuum cannot be discrete because it is not well enough defined. This makes mathematics so bizarre it becomes unpalatable
6 to mathematicians, and foredooms the whole of Brouwer s program. This is a pity, because Brouwer had a remarkable insight into the defects of classical mathematics, and he made a heroic attempt to set things right. (Foundations of Constructive Analysis,1967: 6) (A similar tendency to sarcasm often appears in Bishop s remarks on foundational issues.) Bishop s real numbers, or sequences of rationals defining them, are given by rules.
7 Martin-Löf s intuitionistic type theory, and the homotopy type theory that developed from it, appear not to use the concept of free choice sequence either. These are major applications of intuitionistic ideas, with connections to theoretical computer science. And it should also be noted that even some authors sympathetic to free choice sequences have tried to show that they can be explained away as a sort of façon de parler, using axioms of open data, or analytic (Σ 11 ) data, to reduce discourse about them to talk of constructive functions.
8 I am not necessarily opposed to such ideas, but I do not regard them as important for getting rid of a fundamental concept. In any event, the idea of free choice sequences I will introduce is completely different from that which motivated these proposals, since it is supposed to supplement classical mathematics, not intuitionistic mathematics, conceived as based on any idea of constructivism.
9 In this talk I shall outline how a concept of free choice sequence could be combined with an acceptance of classical mathematics. I do not wish to identify classical mathematics with any particular axiomatization such as ZFC. Most classical mathematicians other than those working in set theory itself, probably do not think in terms of particular sets of axioms, but apply the set theoretic concepts intuitively.
10 (Category theory is of course an important part of contemporary classical mathematics, and we don t need to go into the issues about its relation or lack of it to set theory. [Intuitionism actually plays some role in category theory, but this is not important here.]) It would be in consonance with Brouwer s own attitude towards intuitionistic mathematics and also its exposition in Heyting s Intuitionism, an Introduction (1956) and Dummett s Elements of Intuitionism (1977) simply to give the theorems intuitively and not rely on an axiomatization. I think this is true of much of classical mathematics also.
11 Now, let s consider a classical mathematician confronted with time. Here we think of time as represented by discrete linearly ordered moments. In other words, with the order type of the positive integers. This was Brouwer s conception as given in his notion of free choice sequence.
12 We assume that the instances of time are given only as a potential totality. There is no end of time from which all the instances of time can be surveyed. Of course, there is a considerable idealization involved here. The creative subject, who chooses the free choice sequences, must be assumed to be immortal. And even when the sequence is determined by a machine flipping a coin or casting a die, it must be assumed to be a perpetual motion machine.
13 On the other hand, there may be some scientific models in which there is an end of time, even for a given subject. And there may be general relativistic models in which after an end of time, there starts a new sequence of time. I do not take such things into account here, nor do I worry about absolute simultaneity and special relativity. Everything can be assumed to be the proper time of a single subject.
14 I believe that Brouwer once used the term the classical continuum for the continuum before free choice sequences, and held that the continuum as given by free choice sequences is an extension of it. Here the term classical continuum would mean the continuum as given by lawlike sequences of rationals satisfying the usual convergence conditions (i.e. a constructive continuum). (It might mean the continuum as a whole taken as primitive.)
15 In the conception I have here, the classical continuum simply consists of arbitrary real numbers, defined in one of the usual classical ways (Cauchy sequences or Dedekind cuts). For the mathematics here is simply the usual classical mathematics. The reals determined by free choice sequences are an extension of the classical continuum. However, we are considering sequences of natural numbers, and arbitrary such sequences. (Or, as I will explain later, arbitrary sequences with an upper bound condition.)
16 So, for example, one can consider a coin flipped independently an arbitrary number of times. This might correspond to a lawless sequence. The total number of possibilities is most naturally represented as a tree with the topology of the Cantor set. I am using the term tree rather the intuitionistic spread to emphasize that the mathematics is classical.
17 No doubt this is a simple example of a fan in the intuitionistic sense. However, other finitary trees (spreads) could easily be given, all representing possibilities for what the sequence might be, but never stating which branch corresponds to the real one. Brouwer s proof of the bar theorem, and hence of the fan theorem, has given rise to a fair amount of comment and has some difficulty in intuitionistic mathematics.
18 (The most hostile comment comes, once again, from Bishop, who says, to accept Brouwer s argument as a proof would destroy the character of mathematics. (Foundations of Constructive Analysis, 1967: 70) But he acknowledges that, say, the fan theorem, has never been counterexampled and thinks the situation tantalizing since we will never have a proof, nor will we have a counterexample.) More sympathetic authors have also regarded Brouwer s argument for these theorems as problematic, and may simply take them as axioms.
19 In the present case, there is no difficulty about the fan theorem, which is crucial to the result that a continuous function on a closed interval is uniformly continuous. Since the mathematics of trees with at most finite branching and where every path has finite length (a fan) is classical, König s infinity lemma holds, and hence the fan theorem holds. Similarly, there is no difficulty about the bar theorem.
20 Now, let me give an example of why, even though one accepts classical mathematics, the law of excluded middle will fail for infinitely proceeding sequences (choice sequences, in the present conception). For example, if the terms of the sequence are bounded and are identified with digits of a real number in the unit interval expanded to an appropriate base, we cannot assert at any time that the number is algebraic or transcendental. Remember that there is no end of time, and that probabilistic considerations cannot be used even if the individual terms of the sequence are given by random throws of a coin or a die.
21 In such a case, no doubt there is a probability of 0 that the number will be algebraic, but we cannot use this to assert that the number will be transcendental. (Of course, in the continuum extended by free choice sequences, real numbers need not have a determinate expansion to any base, but this is another matter.)
22 We are really considering here a family of models depending on what restrictions are being placed on the free choice sequence, assumed to be a sequence of natural numbers. If there is a bound on the numbers allowed, this will be reflected in the branching of the tree. It is however assumed that any classical sequence subject to the upper bound restriction, if there is one, is an allowable one in the temporal path. The creating subject is allowed to choose according to any temporally possible sequence.
23 One point needs to be clarified. Ideally, I would like to include all classically admissible sequences in those chosen by the creating subject. But these will be non-denumerable in number. And one might think that this is too much of an idealization. A creating subject can choose any denumerable number of sequences simultaneously simply by alternating his activities from one to another according to some plan.
24 But an uncountable totality of sequences cannot be done in this manner. So one might more weakly postulate that all definable sequences are to be included in those chosen by the creating subject, and these of course could be denumerable in cardinality. Which sequences are definable may depend on the exact language used, a point I have left deliberately vague. But it will include all those sequences that are intuitively thought to be classically definable.
25 It is important to allow all definable sequences since we want all classically definable reals to be included in the model. Note also that on this conception there is no analogue of Troelstra s paradox, other than the known fact that only countably members of the continuum are included. And in an appropriate metalanguage, one could define a diagonal element, given enough extra resources.
26 Also, lawless sequences with any given initial segment are included, as well as sequences with restrictions added by one or more free decisions (which need not be effective). So that α x continuity holds, or at least α!x continuity, but not α β continuity, given Kripke s schema. The definable sequences replace the lawlike sequences in the usual conception of free choice sequences. But here there is no particular effectiveness idea, just definability.
27 Now, let us return to issue of the law of excluded middle and its failure on the present conception. We are assuming a model with branching time, but no one knows which branch is actual. When does the failure set in? According to one reading of Aristotle s De Interpretatione (and my impression is that for a long time it was the received reading), the failure sets in at the very outset.
28 In this reading no one can say that either there will be a sea battle tomorrow or there will not, since the future is indeterminate. One would have to change the example to correspond with free choice sequences. Or make the value of the sequence dependent on whether there will be a sea battle tomorrow. But the idea is clear enough. In this model the idea of the branching time model consists essentially in treating it with the semantics of Kripke models: a disjunction is true at a point iff one disjunct is.
29 But the motivation is quite different from the one I originally gave for such models. The original idea was that the points on a branch represent evidential situations and later points represent situations in which one gets more evidence. One may remain stuck at a single point for an arbitrarily long time, but only if one gets more evidence can one assert a disjunction without being able to assert a given disjunct. This might correspond reasonably well to the intuitionistic idea that proving a disjunction amounts to having a method to prove at least one of the disjuncts.
30 Here, on the Aristotelian model, the idea is different, since the nodes of the tree represent points in time, where later ones represent later points. Then the law of excluded middle fails simply because the future is not determined, though if one waits until the next day, one will know which disjunct is true. Now, this might be a view, but I think it does not so well accord with our intuitions about free choice sequences. If we can wait and see, in some finite time, which of two disjuncts is true here especially for the law of excluded middle then one can assert it in advance.
31 In Aristotle s example, there either will be a sea battle tomorrow or they will not, though we have to wait till tomorrow to see which is true. Putting things a bit more formally: If there is a bar on the branching time tree, so that any path along it will decide between the two disjuncts eventually, then the disjunction can be asserted in advance, though we have to wait a bit to see which one holds.
32 This means that the semantics corresponds to Beth models. Remembering that Konig s lemma and the fan theorem hold for finitary spreads, there will actually be in the case of finite branching an upper bound for how long one has to wait. So here, following Brouwerian intuitionism, we assume the semantics of the connectives for free choice sequences to be given in terms of Beth models. We otherwise continue to take the underlying mathematics to be classical.
33 Thus the idea is that the ordinary classical continuum is to be supplemented by one given in terms of Brouwerian free choice sequences. For these, the usual intuitionistic mathematics is assumed, just as in textbooks such as those of Heyting (1956) and Dummett (1977). I do wish, however, to make some comment on the role of Kripke s schema in this supplementation.
34 I originally proposed it in the weak form: α[( A xαx = 0) ( xαx 0 A)] But there is a stronger and much simpler form: α[a xαx 0] I still prefer the weak form. (And I would hold this preference in ordinary intuitionistic mathematics too, as well as on the present conception.) Moreover models have been found in which the strong form holds. Also, as van Dalen (1977) remarks, the strong schema is trivially true in classical mathematics.
35 What is the reason? Intuitionistically, to prove a conditional A B, one must have a technique so that from any proof of A one can get a proof of B. Now, the idea of the schema, based on Brouwer s own arguments about the creative subject, is that one imagines a sequence in time that is 0 as long as A has not been proved but is 1 as soon as it has been proved.
36 Then one claims that a proof that the sequence is always 0 amounts to a proof that A can never be proved, i.e. that it is absurd. If the sequence gets the value 1, then A has been proved. What would justify the strong form? Well, as Myhill says, if A is ever proved, it is proved at some definite time, and then one gets a value of α that is not equal to 0 simply by looking at your watch (or calendar, as the case may be).
37 However: Is the idea of the intuitionistic conditional (remember that from a proof of A, one can get a proof of B) such that intuitionistic proofs, which indeed must take place at some definite time, have the time of their occurrence as part of the proof, so that the same proof would be different if it happened to occur at a different time? I think not. In that case, the strong form does not appear to be justified, but the weak form is.
38 Remark: Heyting allows his character representing the intuitionist to object even to the weak form: if a law is passed throughout the world prohibiting the making of any mathematical deduction whatever, then the proof of α 0 fails. (1956: 116. In effect, ( A xαx = 0) fails.) But the idea of such a law simply gets rid of the entire intuitionistic interpretation of the conditional, since A B is supposed to mean that from any proof of A, one can get a proof of B, and this becomes a vacuous notion because of the supposed law.)
39 So, what have I argued here? That a Brouwerian theory of free choice sequences could be added to classical mathematics, without any constructive doubts as to its validity. I have tried to be deliberately informal, in the spirit that Brouwer himself would have preferred.
40 Thank you!
Realizable Extensions of Intuitionistic Analysis: Brouwer, Kleene, Kripke and the End of Time
Realizable Extensions of Intuitionistic Analysis: Brouwer, Kleene, Kripke and the End of Time Joan Rand Moschovakis Occidental College, Emerita ASL Special Session on Intuitionism and Intuitionistic Logic
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationPhilosophy of Mathematics Intuitionism
Philosophy of Mathematics Intuitionism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 01/12/15 Classical mathematics Consider the Pythagorean argument that 2 is irrational: 1. Assume that
More informationMetainduction in Operational Set Theory
Metainduction in Operational Set Theory Luis E. Sanchis Department of Electrical Engineering and Computer Science Syracuse University Syracuse, NY 13244-4100 Sanchis@top.cis.syr.edu http://www.cis.syr.edu/
More informationThrowing Darts, Time, and the Infinite
Erkenn DOI 10.1007/s10670-012-9371-x ORIGINAL PAPER Throwing Darts, Time, and the Infinite Jeremy Gwiazda Received: 23 August 2011 / Accepted: 2 March 2012 Ó Springer Science+Business Media B.V. 2012 Abstract
More informationPhilosophies of Mathematics. The Search for Foundations
Philosophies of Mathematics The Search for Foundations Foundations What are the bedrock, absolutely certain, immutable truths upon which mathematics can be built? At one time, it was Euclidean Geometry.
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationIntuitionism and effective descriptive set theory
Intuitionism and effective descriptive set theory Joan R. Moschovakis and Yiannis N. Moschovakis Occidental College and University of California, Los Angeles L. E. J. Brouwer, fifty years later, Amsterdam,
More informationModel theory and constructive mathematics. Thierry Coquand
Thierry Coquand Model theory A challenge to constructive mathematics Important results: conjecture Ax-Kochen, differential algebraic closure, Mordell-Lang 1 Model theory The starting point of model theory,
More informationStructuring Logic with Sequent Calculus
Structuring Logic with Sequent Calculus Alexis Saurin ENS Paris & École Polytechnique & CMI Seminar at IIT Delhi 17th September 2004 Outline of the talk Proofs via Natural Deduction LK Sequent Calculus
More informationElimination of binary choice sequences
Elimination of binary choice sequences Tatsuji Kawai Japan Advanced Institute of Science and Technology JSPS Core-to-Core Program Workshop on Mathematical Logic and its Application 16 17 September 2016,
More informationThe Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)
The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018) From the webpage of Timithy Kohl, Boston University INTRODUCTION Note. We will consider infinity from two different perspectives:
More informationCSCI3390-Lecture 6: An Undecidable Problem
CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or
More informationCS3110 Spring 2017 Lecture 11: Constructive Real Numbers
CS3110 Spring 2017 Lecture 11: Constructive Real Numbers Robert Constable Reminder: Prelim in class next Tuesday. It will not cover the real numbers beyond this lecture. Note: One definition of the void
More informationKaplan s Paradox and Epistemically Possible Worlds
Kaplan s Paradox and Epistemically Possible Worlds 1. Epistemically possible worlds David Chalmers Metaphysically possible worlds: S is metaphysically possible iff S is true in some metaphysically possible
More informationHow Philosophy Impacts on Mathematics
.. How Philosophy Impacts on Mathematics Yang Rui Zhi Department of Philosophy Peking University Fudan University March 20, 2012 Yang Rui Zhi (PKU) Philosophical Impacts on Mathematics 20 Mar. 2012 1 /
More informationTruth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation.
Outline 1 2 3 4 5 1 / 41 2 / 41 The Liar Sentence Let L be the sentence: This sentence is false This sentence causes trouble If it is true, then it is false So it can t be true Thus, it is false If it
More informationChapter 1 A computational interpretation of forcing in Type Theory
Chapter 1 A computational interpretation of forcing in Type Theory Thierry Coquand and Guilhem Jaber Abstract In a previous work, we showed the uniform continuity of definable functionals in intuitionistic
More informationThere are infinitely many set variables, X 0, X 1,..., each of which is
4. Second Order Arithmetic and Reverse Mathematics 4.1. The Language of Second Order Arithmetic. We ve mentioned that Peano arithmetic is sufficient to carry out large portions of ordinary mathematics,
More informationIntroduction to Logic and Axiomatic Set Theory
Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some
More informationModels and Interpretations of (Intuitionistic) Analysis
Models and Interpretations of (Intuitionistic) Analysis Joan Rand Moschovakis Occidental College (Emerita), MPLA VIG at UCLA February 4-6, 2011 What is intuitionistic analysis and why should we care? Historically,
More informationWorkshop 1- Building on the Axioms. The First Proofs
Boston University Summer I 2009 Workshop 1- Building on the Axioms. The First Proofs MA341 Number Theory Kalin Kostadinov The goal of this workshop was to organize our experience with the common integers
More informationcse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018
cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics
More informationPROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL
THOMAS HOFWEBER PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL 1. PROOF-THEORETIC REDUCTION AND HILBERT S PROGRAM Hilbert s program in the philosophy of mathematics comes in two parts. One part is a
More informationConstructive decidability of classical continuity
Constructive decidability of classical continuity Martín H. Escardó Version of March 27, 2012 Abstract We show that the following instance of the principle of excluded holds: any function on the one-point
More informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
More informationarxiv: v1 [math.lo] 30 Jan 2018
THE THIRD TRICK HANNES DIENER AND MATTHEW HENDTLASS ABSTRACT. We prove a result, similar to the ones known as Ishihara s First and Second Trick, for sequences of functions. arxiv:80.036v [math.lo] 30 Jan
More informationProof Theory and Subsystems of Second-Order Arithmetic
Proof Theory and Subsystems of Second-Order Arithmetic 1. Background and Motivation Why use proof theory to study theories of arithmetic? 2. Conservation Results Showing that if a theory T 1 proves ϕ,
More informationCONSTRUCTION OF THE REAL NUMBERS.
CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
More informationMcTaggart s Argument for the Unreality of Time:
McTaggart s Argument for the Unreality of Time: A Temporal Logical Analysis Hunan Rostomyan In this paper I want to examine McTaggart s [1908] argument for the unreality of time. McTaggart starts with
More informationNIP Summer School 2011 Truth and Paradox Lecture #1
NIP Summer School 2011 Truth and Paradox Lecture #1 Colin Caret & Aaron Cotnoir 1 Tarskianism 2 Basic Paracomplete Theories 3 Basic Paraconsistent Theories Definition 1.1 (Formal Languages) A formal language
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationThe Relation Reflection Scheme
The Relation Reflection Scheme Peter Aczel petera@cs.man.ac.uk Schools of Mathematics and Computer Science The University of Manchester September 14, 2007 1 Introduction In this paper we introduce a new
More informationAn Intuitive Introduction to Motivic Homotopy Theory Vladimir Voevodsky
What follows is Vladimir Voevodsky s snapshot of his Fields Medal work on motivic homotopy, plus a little philosophy and from my point of view the main fun of doing mathematics Voevodsky (2002). Voevodsky
More informationModel Theory in the Univalent Foundations
Model Theory in the Univalent Foundations Dimitris Tsementzis January 11, 2017 1 Introduction 2 Homotopy Types and -Groupoids 3 FOL = 4 Prospects Section 1 Introduction Old and new Foundations (A) (B)
More informationIntroduction to Intuitionistic Logic
Introduction to Intuitionistic Logic August 31, 2016 We deal exclusively with propositional intuitionistic logic. The language is defined as follows. φ := p φ ψ φ ψ φ ψ φ := φ and φ ψ := (φ ψ) (ψ φ). A
More informationProducts, Relations and Functions
Products, Relations and Functions For a variety of reasons, in this course it will be useful to modify a few of the settheoretic preliminaries in the first chapter of Munkres. The discussion below explains
More informationClass 15: Hilbert and Gödel
Philosophy 405: Knowledge, Truth and Mathematics Spring 2008 M, W: 1-2:15pm Hamilton College Russell Marcus rmarcus1@hamilton.edu I. Hilbert s programme Class 15: Hilbert and Gödel We have seen four different
More informationGödel s Programm and Ultimate L
Gödel s Programm and Ultimate L Fudan University National University of Singapore, September 9, 2017 Outline of Topics 1 CT s Problem 2 Gödel s Program 3 Ultimate L 4 Conclusion Remark Outline CT s Problem
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationvia Topos Theory Olivia Caramello University of Cambridge The unification of Mathematics via Topos Theory Olivia Caramello
in University of Cambridge 2 / 23 in in In this lecture, whenever I use the word topos, I really mean Grothendieck topos. Recall that a Grothendieck topos can be seen as: a generalized space a mathematical
More informationConstructive analysis
Constructive analysis Philosophy, Proof and Fundamentals Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Interval
More informationThis is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability
16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of
More informationSequence convergence, the weak T-axioms, and first countability
Sequence convergence, the weak T-axioms, and first countability 1 Motivation Up to now we have been mentioning the notion of sequence convergence without actually defining it. So in this section we will
More informationBrouwer s Fan Theorem: An Overview
Brouwer s Fan Theorem: An Overview, ctc89@cornell.edu Fall 2015 Introduction Beginning in the early 1920 s, L.E.J. Brouwer proposed an intuitionsitic reformation of the foundations of mathematics. 1 Among
More information17.1 Correctness of First-Order Tableaux
Applied Logic Lecture 17: Correctness and Completeness of First-Order Tableaux CS 4860 Spring 2009 Tuesday, March 24, 2009 Now that we have introduced a proof calculus for first-order logic we have to
More informationChapter 2 Classical Probability Theories
Chapter 2 Classical Probability Theories In principle, those who are not interested in mathematical foundations of probability theory might jump directly to Part II. One should just know that, besides
More informationPrefixed Tableaus and Nested Sequents
Prefixed Tableaus and Nested Sequents Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: melvin.fitting@lehman.cuny.edu
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 0 To Infinity And Beyond: Countability and Computability This note ties together two topics that might seem like they have
More informationINTUITIONISM AS GENERALIZATION. Fred Richman. New Mexico State University. Philosophia Mathematica, 5è1990è, 124í128
INTUITIONISM AS GENERALIZATION Fred Richman New Mexico State University Philosophia Mathematica, 5è1990è, 124í128 Iwas inspired, not to say provoked, to write this note by Michel J. Blais's article Apragmatic
More informationWarm-Up Problem. Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet.
Warm-Up Problem Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet Warm up: Given a program that accepts input, is there an
More informationMAGIC Set theory. lecture 1
MAGIC Set theory lecture 1 David Asperó University of East Anglia 15 October 2014 Welcome Welcome to this set theory course. This will be a 10 hour introduction to set theory. The only prerequisite is
More informationA note on Bar Induction in Constructive Set Theory
A note on Bar Induction in Constructive Set Theory Michael Rathjen Department of Mathematics The Ohio State University Columbus, OH 43210, USA and School of Mathematics University of Leeds Leeds, LS2 9JT,
More informationGeneralized Quantifiers Logical and Linguistic Aspects
Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun
More informationGREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM
The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 GREGORY TREES, THE CONTINUUM, AND MARTIN S AXIOM KENNETH KUNEN AND DILIP RAGHAVAN Abstract. We continue the investigation of Gregory trees and
More informationA little context This paper is concerned with finite automata from the experimental point of view. The behavior of these machines is strictly determin
Computability and Probabilistic machines K. de Leeuw, E. F. Moore, C. E. Shannon and N. Shapiro in Automata Studies, Shannon, C. E. and McCarthy, J. Eds. Annals of Mathematics Studies, Princeton University
More information17. Some advanced topics in logic
17. Some advanced topics in logic 17.1 What do we study in advanced logic? Students may imagine that in more advance logic we continue with first order logic, translating more complex sentences and using
More informationType Theory and Constructive Mathematics. Type Theory and Constructive Mathematics Thierry Coquand. University of Gothenburg
Type Theory and Constructive Mathematics Type Theory and Constructive Mathematics Thierry Coquand University of Gothenburg Content An introduction to Voevodsky s Univalent Foundations of Mathematics The
More informationCIS 2033 Lecture 5, Fall
CIS 2033 Lecture 5, Fall 2016 1 Instructor: David Dobor September 13, 2016 1 Supplemental reading from Dekking s textbook: Chapter2, 3. We mentioned at the beginning of this class that calculus was a prerequisite
More informationNotes on the Foundations of Constructive Mathematics
Notes on the Foundations of Constructive Mathematics by Joan Rand Moschovakis December 27, 2004 1 Background and Motivation The constructive tendency in mathematics has deep roots. Most mathematicians
More informationOutline. 1 Background and Aim. 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion
Outline 1 Background and Aim 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016
More informationANOTHER UNIQUE WEAK KÖNIG S LEMMA WKL!!
ANOTHER UNIQUE WEAK KÖNIG S LEMMA WKL!! JOAN RAND MOSCHOVAKIS For Professor Helmut Schwichtenberg Abstract. In [2] J. Berger and Ishihara proved, via a circle of informal implications involving countable
More informationCHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)
CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) MATH 378, CSUSM. SPRING 2009. AITKEN This chapter reviews some of the background concepts needed for Math 378. This chapter is new to the course (added Spring
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationAn Intuitively Complete Analysis of Gödel s Incompleteness
An Intuitively Complete Analysis of Gödel s Incompleteness JASON W. STEINMETZ (Self-funded) A detailed and rigorous analysis of Gödel s proof of his first incompleteness theorem is presented. The purpose
More informationOn the Effectiveness of Symmetry Breaking
On the Effectiveness of Symmetry Breaking Russell Miller 1, Reed Solomon 2, and Rebecca M Steiner 3 1 Queens College and the Graduate Center of the City University of New York Flushing NY 11367 2 University
More informationConstructive Logic. Thierry Coquand. August 2008
Thierry Coquand August 2008 This course To present constructive mathematics using logic Introduction to recent work in constructive algebra (H. Lombardi, P. Schuster, I. Yengui,... ) Connection with computer
More informationREU 2007 Transfinite Combinatorics Lecture 9
REU 2007 Transfinite Combinatorics Lecture 9 Instructor: László Babai Scribe: Travis Schedler August 10, 2007. Revised by instructor. Last updated August 11, 3:40pm Note: All (0, 1)-measures will be assumed
More informationConstructive (functional) analysis
Constructive (functional) analysis Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Proof and Computation, Fischbachau,
More informationThe Adjoint Functor Theorem.
The Adjoint Functor Theorem. Kevin Buzzard February 7, 2012 Last modified 17/06/2002. 1 Introduction. The existence of free groups is immediate from the Adjoint Functor Theorem. Whilst I ve long believed
More informationOn the scope of diagonal argument and on contradictory equivalence.
Daniil Teplitskiy, Russia, Saint Petersburg PSI Co. Ltd. 24JUN2011 To my teachers and good people Isaak Perchenok and Rustem Valeyev. To my friend Aleksey Kiselev whose intellectual paradigm underlies
More informationter. on Can we get a still better result? Yes, by making the rectangles still smaller. As we make the rectangles smaller and smaller, the
Area and Tangent Problem Calculus is motivated by two main problems. The first is the area problem. It is a well known result that the area of a rectangle with length l and width w is given by A = wl.
More informationGenerality, Extensibility, and Paradox
Generality, Extensibility, and Paradox James Studd Oxford Aristotelian Society 28th November 2016 Outline I. Absolute generality an introduction II. The Dummettian argument a coherent case for relativism?
More informationThe Axiom of Infinity, Quantum Field Theory, and Large Cardinals. Paul Corazza Maharishi University
The Axiom of Infinity, Quantum Field Theory, and Large Cardinals Paul Corazza Maharishi University The Quest for an Axiomatic Foundation For Large Cardinals Gödel believed natural axioms would be found
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27
CS 70 Discrete Mathematics for CS Spring 007 Luca Trevisan Lecture 7 Infinity and Countability Consider a function f that maps elements of a set A (called the domain of f ) to elements of set B (called
More informationEmbedding the Classical in the Intuitionistic Continuum
Embedding the Classical in the Intuitionistic Continuum Joan Rand Moschovakis Occidental College (Emerita) and MPLA UC Irvine April 4, 2014 Outline: 1. Intuitionistic vs. classical logic 2. Intuitionistic
More informationCS3110 Fall 2013 Lecture 11: The Computable Real Numbers, R (10/3)
CS3110 Fall 2013 Lecture 11: The Computable Real Numbers, R (10/3) Robert Constable 1 Lecture Plan More about the rationals dependent types enumerating Q (Q is countable) Function inverses bijections one-one
More informationCSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides
CSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides First Person: Second Person: Family Name: Family Name: Given Name: Given
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
More informationTuring Machines, diagonalization, the halting problem, reducibility
Notes on Computer Theory Last updated: September, 015 Turing Machines, diagonalization, the halting problem, reducibility 1 Turing Machines A Turing machine is a state machine, similar to the ones we have
More informationBeliefs, we will assume, come in degrees. As a shorthand, we will refer to these. Syracuse University
AN OPEN ACCESS Ergo JOURNAL OF PHILOSOPHY Calibration and Probabilism MICHAEL CAIE Syracuse University In this paper, I consider an argument due to Bas van Fraassen that attempts to show that considerations
More informationIntroduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today The first part of the course will
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationCSE 311: Foundations of Computing. Lecture 26: More on Limits of FSMs, Cardinality
CSE 311: Foundations of Computing Lecture 26: More on Limits of FSMs, Cardinality Last time: Languages and Representations All Context-Free??? Prove there is Regular a context-free DFA language 0* NFA
More informationWe introduce one more operation on sets, perhaps the most important
11. The power set Please accept my resignation. I don t want to belong to any club that will accept me as a member. Groucho Marx We introduce one more operation on sets, perhaps the most important one:
More informationCantor and sets: La diagonale du fou
Judicaël Courant 2011-06-17 Lycée du Parc (moving to Lycée La Martinière-Monplaisir) Outline 1 Cantor s paradise 1.1 Introduction 1.2 Countable sets 1.3 R is not countable 1.4 Comparing sets 1.5 Cardinals
More informationDirect Proof and Counterexample I:Introduction
Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting :
More informationRussell s logicism. Jeff Speaks. September 26, 2007
Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................
More informationConstructive decidability of classical continuity
Constructive decidability of classical continuity Martín H. Escardó Version of January 9, 2013 Abstract We show that the following instance of the principle of excluded middle holds: any function on the
More informationExtended Essay - Mathematics
Extended Essay - Mathematics Creating a Model to Separate or Group Number Sets by their Cardinalities Pope John Paul II C.S.S. September 2009 Candidate Number: 001363-012 The conquest of the actual infinite
More informationDirect Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.
Direct Proof and Counterexample I:Introduction Copyright Cengage Learning. All rights reserved. Goal Importance of proof Building up logic thinking and reasoning reading/using definition interpreting statement:
More informationConstructive reverse mathematics: an introduction
Constructive reverse mathematics: an introduction Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan CMFP 2013, Nis,
More informationMeta-logic derivation rules
Meta-logic derivation rules Hans Halvorson February 19, 2013 Recall that the goal of this course is to learn how to prove things about (as opposed to by means of ) classical first-order logic. So, we will
More informationIncompatibility Paradoxes
Chapter 22 Incompatibility Paradoxes 22.1 Simultaneous Values There is never any difficulty in supposing that a classical mechanical system possesses, at a particular instant of time, precise values of
More informationMONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC
Bulletin of the Section of Logic Volume 45:3/4 (2016), pp. 143 153 http://dx.doi.org/10.18778/0138-0680.45.3.4.01 Anna Glenszczyk MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC Abstract We investigate
More informationLecture Notes on Inductive Definitions
Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 September 2, 2004 These supplementary notes review the notion of an inductive definition and
More informationMethuselah s Diary and the Finitude of the Past. Ben Waters
Forthcoming in Philosophia Christi Volume 15, Number 2 (2013) Methuselah s Diary and the Finitude of the Past Ben Waters Abstract William Lane Craig modified Bertrand Russell s Tristram Shandy example
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More information