DOCSLIB.ORG

Markov's Principle, Markov's Rule and the Notion Of

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Markov's Principle, Markov's Rule and the Notion Of MARKOV'S PRINCIPLE, MARKOV'S RULE AND THE NOTION OF CONSTRUCTIVE PROOF JOAN RAND MOSCHOVAKIS (6/19/2018 FINAL DRAFT, CORRECTED 8/2/2018) 1. Introduction In [34] Georg Kreisel reflected at length on Church's Thesis CT, the principle proposed in 1936 by Alonzo Church ([9]) as a definition: \We now define the notion . of an effectively calculable function of positive integers by identifying it with the notion of a recursive function of positive integers." An equivalent version with \recursive function" replaced by \function computable by a Turing machine" was proposed the same year by Alan Turing. Yiannis Moschovakis ([49]) observes that CT \refers essentially to the natural numbers, and so its truth or falsity depends on what they are." Of course its truth or falsity also depends on what it means for a calculation to be effective, and this question forces a distinction between the constructive and classical meanings of CT. This distinction in turn leads to Markov's Principle MP, which asserts (in its original version) that if a recursive algorithm cannot fail to converge then it converges. In its capacity as a principle of unbounded search, MP refers essentially to the natural numbers so its truth or falsity depends on what they are, and in particular on the fact that ! is the order type of the standard natural numbers. Markov's Principle is not generally accepted by constructive mathematicians. Beeson ([2], p. 47) notes that \. even [Markov and the Russian constructivists] keep careful track of which theorems depend on it and which are proved with- out it." Bishop constructivists accept neither CT nor MP, although their work is consistent with both. Kreisel [32] proved that MP is not a theorem of intuition- istic arithmetic. Brouwer and traditional intuitionists reject an analytical version of MP, but their reasoning has more to do with the nature of the intuitionistic continuum than with what the natural numbers are. Markov's Rule MR, in contrast, is admissible for most formal systems T based on intuitionistic logic.1 In its simplest form the rule states that if T proves that a particular recursive algorithm cannot fail to converge, then T proves that it converges. Whether or not appropriate versions of the rule are always admissible for constructive theories evidently depends on what a constructive proof is. Constructive mathematics is often described simply as \mathematics done with intuitionistic logic." While this oversimplification ignores the difference between constructive and classical answers to the question of what constitutes a legitimate mathematical object, it does express a fundamental aspect of constructive proof. In [19] Arend Heyting quotes Kreisel ([31]) as saying \. the notion of construc- tive proof is vague." Heyting objects that In addition to M. A. Marfori and M. Petrolo, I am grateful to George Dyson for a copy of [13]. 1H. Friedman [14] and Dragalin [12] independently discovered a simple method for proving the admissibility of Markov's Rule which applies uniformly to pure and applied intuitionistic systems. 1 2 JOAN RAND MOSCHOVAKIS (6/19/2018 FINAL DRAFT, CORRECTED 8/2/2018) . the notion of vagueness is vague in itself, what we need, is a precise notion of precision. As far as I know, the only notion of this sort is based on a formal system. But even for a formal system with a recursive proof predicate, \. the difficulty reappears if we ask what it means that a given formula A is provable," for instance if ::9p(p ` A) rather than 9p(p ` A), leading back to Markov's Principle, which Heyting did not accept. More than twenty years after Brouwer rejected the law of excluded middle, Heyting formalized intuitionistic propositional logic and intuitionistic arithmetic. Pure intuitionistic predicate logic was isolated as a proper subsystem of classical predicate logic; cf. Kleene [25] where several equivalent formalizations are studied. Here we follow Kreisel [33] in adopting the acronym HPC (for \Heyting predicate calculus") for a formal system of intuitionistic predicate logic.2 The question of what constitutes a constructive proof depends essentially on whether HPC is sound and complete for its intended intuitionistic interpretation, and this question leads again to Markov's Principle, as G¨odeland Kreisel observed. Markov's Principle, Markov's Rule and the common notion of constructive proof appear to be legitimate candidates for investigation in the spirit of Kreisel's ideal of informal rigour (cf. [34]). Following Heyting's implicit advice, we consider MP and principles weaker than MP in the context of formal systems for intuitionistic arithmetic and analysis. In the process we hope to gather evidence for an inter- mediate principle GDK which is equivalent to the weak completeness of HPC for Beth semantics, as analyzed in detail by Dyson and Kreisel ([13]). In [33] Kreisel suggests that this principle \may be provable on the basis of as yet undiscovered axioms which hold for the intended interpretation (but not for the realizability interpretations). So the problem whether HPC is weakly complete is still open." That was the situation in June of 1962. During the following academic year Kleene succeeded in proving the independence of Markov's Principle from his for- mal system I of intuitionistic analysis, using his new, typed \special realizability" interpretation.3 The complete proof appeared in 1965 in Kleene and Vesley's [27], along with the untyped function realizability interpretation which established the consistency of I, with or without Markov's principle, relative to a classically correct subtheory. While GDK is function-realizable and special-realizable (and therefore consis- tent with I but weaker than Markov's Principle), it is not Grealizable in the sense of the author's [43] so does not follow from weak Church's Thesis. It is easily seen to be equivalent (assuming a classically and intuitionistically correct version of the binary fan theorem) to the double negation of weak K¨onig'sLemma. In other words, HPC is weakly complete for Beth semantics if and only if weak K¨onig'sLemma is persistently consistent with the fan theorem in the sense that any counterexample to either would generate a counterexample to the other.4 We conjecture that GDK is correct on the intended interpretation of intuition- istic analysis as a theory of numbers and (arbitrary) free choice sequences, and that HPC is weakly complete for Beth semantics. 2Troelstra and van Dalen [56] prefer IQC, abbreviating \intuitionistic quantificational calcu- lus," and reserve IPC for its propositional subsystem. 3In 1962-63 I was a graduate student working with Kleene at the University of Wisconsin, and I still vividly remember his enthusiasm as he presented this very fresh result to the seminar. 4Kleene's counterexample for recursive sequences (cf. [27]) applies equally to both. MARKOV'S PRINCIPLE, MARKOV'S RULE AND THE NOTION OF CONSTRUCTIVE PROOF3 2. MP and MR in the context of formal systems In 1958 Kreisel ([32]) developed a modification of Kleene's number-realizability interpretation to show that the primitive recursive form of Markov's Principle, which is (classically) consistent with Heyting arithmetic HA by Kleene's number- realizability, is independent of HA. Since then logicians have analyzed versions of MP and MR over intuitionistic predicate calculus and over constructive and intu- itionistic theories of natural numbers, real numbers, infinite sequences of natural numbers, and primitive recursive functions of all finite types. While a complete annotated bibliography of these investigations is beyond the scope of this article, in this and following sections we survey the folklore and contributions by many researchers over the past sixty years. Much more information is contained in the references and their bibliographies. 2.1. Formal versions of MP. Over intuitionistic arithmetic HA Markov's Prin- ciple can be rendered by a formula: MP0 : 8e8x[:8y:T(e; x; y) ! 9yT(e; x; y)] where T(e; x; y) is a prime formula expressing Kleene's T-predicate (\y is a g¨odel number of a successful computation of feg(x)"). Alternatively, it can be expressed by a schema: MPQF : :8x:A(x) ! 9xA(x); where A(x) may contain additional free variables but must be \quantifier-free” (bounded quantifiers are allowed), or MPPR : :8n:A(n) ! 9nA(n) where A(n) must express a primitive recursive relation of n and its other free variables. Over HA all three of MP0, MPQF and MPPR are equivalent. The most general schematic version of Markov's Principle is MPD : 8x(A(x) _:A(x)) & :8x:A(x) ! 9xA(x); (cf. [2], p. 47). Evidently HA + MPD ` MPQF since if A(x) has only bounded quantifiers then HA ` 8x(A(x) _:A(x)). However, Smorynski ([53], p. 365) 5 proved that HA + MPQF 6` MPD. A fortiori MPD is not provable in HPC from instances of (:8x:P(x) ! 9xP(x)) with P(x) prime. We leave the proof 6 that HPC + MPD 6` (:8x:P(x) ! 9xP(x)) as an exercise for the reader. As principles of pure predicate logic, MPD and variants can have no convincing constructive justification because the connection with the natural numbers is lost. Closed instances are persistently consistent with HPC in the sense that their double negations are provable, but the schemas are not persistently consistent because HPC 6` ::8y[8x(P(x; y) _:P(x; y)) & :8x:P(x; y) ! 9xP(x; y)].7 Over a two-sorted theory such as Kleene's I ([27]) and subsystems, Troelstra's EL ([54]) or Veldman's BIM ([60]), Markov's Principle can be strengthened to MP1 : 8α(:8x:α(x) = 0 ! 9xα(x) = 0): 5 In the presence of Church's Thesis, MPQF and MPD are arithmetically equivalent. If CT! is the recursive comprehension principle 8x9!yA(x; y) ! 9e8x9y[T(e; x; y) & A(x; U(y))] (where 9!yB(y) abbreviates 9yB(y) & 8z(B(y) & B(z) ! y = z)), then HA + CT! + MPQF ` MPD.
Load more

Recommended publications
  • Arxiv:1803.01386V4 [Math.HO] 25 Jun 2021
    2009 SEKI http://wirth.bplaced.net/seki.html ISSN 1860-5931 arXiv:1803.01386v4 [math.HO] 25 Jun 2021 A Most Interesting Draft for Hilbert and Bernays’ “Grundlagen der Mathematik” that never found its way into any publi- Working-Paper cation, and 2 CVof Gisbert Hasenjaeger Claus-Peter Wirth Dept. of Computer Sci., Saarland Univ., 66123 Saarbrücken, Germany [email protected] SEKI Working-Paper SWP–2017–01 SEKI SEKI is published by the following institutions: German Research Center for Artificial Intelligence (DFKI GmbH), Germany • Robert Hooke Str.5, D–28359 Bremen • Trippstadter Str. 122, D–67663 Kaiserslautern • Campus D 3 2, D–66123 Saarbrücken Jacobs University Bremen, School of Engineering & Science, Campus Ring 1, D–28759 Bremen, Germany Universität des Saarlandes, FR 6.2 Informatik, Campus, D–66123 Saarbrücken, Germany SEKI Editor: Claus-Peter Wirth E-mail: [email protected] WWW: http://wirth.bplaced.net Please send surface mail exclusively to: DFKI Bremen GmbH Safe and Secure Cognitive Systems Cartesium Enrique Schmidt Str. 5 D–28359 Bremen Germany This SEKI Working-Paper was internally reviewed by: Wilfried Sieg, Carnegie Mellon Univ., Dept. of Philosophy Baker Hall 161, 5000 Forbes Avenue Pittsburgh, PA 15213 E-mail: [email protected] WWW: https://www.cmu.edu/dietrich/philosophy/people/faculty/sieg.html A Most Interesting Draft for Hilbert and Bernays’ “Grundlagen der Mathematik” that never found its way into any publication, and two CV of Gisbert Hasenjaeger Claus-Peter Wirth Dept. of Computer Sci., Saarland Univ., 66123 Saarbrücken, Germany [email protected] First Published: March 4, 2018 Thoroughly rev. & largely extd. (title, §§ 2, 3, and 4, CV, Bibliography, &c.): Jan.
    [Show full text]
  • The Proper Explanation of Intuitionistic Logic: on Brouwer's Demonstration
    The proper explanation of intuitionistic logic: on Brouwer’s demonstration of the Bar Theorem Göran Sundholm, Mark van Atten To cite this version: Göran Sundholm, Mark van Atten. The proper explanation of intuitionistic logic: on Brouwer’s demonstration of the Bar Theorem. van Atten, Mark Heinzmann, Gerhard Boldini, Pascal Bourdeau, Michel. One Hundred Years of Intuitionism (1907-2007). The Cerisy Conference, Birkhäuser, pp.60- 77, 2008, 978-3-7643-8652-8. halshs-00791550 HAL Id: halshs-00791550 https://halshs.archives-ouvertes.fr/halshs-00791550 Submitted on 24 Jan 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Distributed under a Creative Commons Attribution - NonCommercial| 4.0 International License The proper explanation of intuitionistic logic: on Brouwer’s demonstration of the Bar Theorem Göran Sundholm Philosophical Institute, Leiden University, P.O. Box 2315, 2300 RA Leiden, The Netherlands. [email protected] Mark van Atten SND (CNRS / Paris IV), 1 rue Victor Cousin, 75005 Paris, France. [email protected] Der … geführte Beweis scheint mir aber trotzdem . Basel: Birkhäuser, 2008, 60–77. wegen der in seinem Gedankengange enthaltenen Aussagen Interesse zu besitzen. (Brouwer 1927B, n. 7)1 Brouwer’s demonstration of his Bar Theorem gives rise to provocative ques- tions regarding the proper explanation of the logical connectives within intu- itionistic and constructivist frameworks, respectively, and, more generally, re- garding the role of logic within intuitionism.
    [Show full text]
  • E.W. Beth Als Logicus
    E.W. Beth als logicus ILLC Dissertation Series 2000-04 For further information about ILLC-publications, please contact Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam phone: +31-20-525 6051 fax: +31-20-525 5206 e-mail: [email protected] homepage: http://www.illc.uva.nl/ E.W. Beth als logicus Verbeterde electronische versie (2001) van: Academisch Proefschrift ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magni¯cus prof.dr. J.J.M. Franse ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Aula der Universiteit op dinsdag 26 september 2000, te 10.00 uur door Paul van Ulsen geboren te Diemen Promotores: prof.dr. A.S. Troelstra prof.dr. J.F.A.K. van Benthem Faculteit Natuurwetenschappen, Wiskunde en Informatica Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam Copyright c 2000 by P. van Ulsen Printed and bound by Print Partners Ipskamp. ISBN: 90{5776{052{5 Ter nagedachtenis aan mijn vader v Inhoudsopgave Dankwoord xi 1 Inleiding 1 2 Levensloop 11 2.1 Beginperiode . 12 2.1.1 Leerjaren . 12 2.1.2 Rijpingsproces . 14 2.2 Universitaire carriere . 21 2.2.1 Benoeming . 21 2.2.2 Geleerde genootschappen . 23 2.2.3 Redacteurschappen . 31 2.2.4 Beth naar Berkeley . 32 2.3 Beth op het hoogtepunt van zijn werk . 33 2.3.1 Instituut voor Grondslagenonderzoek . 33 2.3.2 Oprichting van de Centrale Interfaculteit . 37 2.3.3 Logici en historici aan Beths leiband .
    [Show full text]
  • Intuitionistic Completeness of First-Order Logic with Respect to Uniform Evidence Semantics
    Intuitionistic Completeness of First-Order Logic Robert Constable and Mark Bickford October 15, 2018 Abstract We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the intended semantics of iFOL and mFOL. Our proof is intuitionistic and provides an effective procedure Prf that converts uniform minimal evidence into a formal first-order proof. We have implemented Prf. Uniform validity is defined using the intersection operator as a universal quantifier over the domain of discourse and atomic predicates. Formulas of iFOL that are uniformly valid are also intuitionistically valid, but not conversely. Our strongest result requires the Fan Theorem; it can also be proved classically by showing that Prf terminates using K¨onig’s Theorem. The fundamental idea behind our completeness theorem is that a single evidence term evd wit- nesses the uniform validity of a minimal logic formula F. Finding even one uniform realizer guarantees validity because Prf(F,evd) builds a first-order proof of F, establishing its uniform validity and providing a purely logical normalized realizer. We establish completeness for iFOL as follows. Friedman showed that iFOL can be embedded in minimal logic (mFOL) by his A-transformation, mapping formula F to F A. If F is uniformly valid, then so is F A, and by our completeness theorem, we can find a proof of F A in minimal logic. Then we intuitionistically prove F from F F alse, i.e. by taking False for A and for ⊥ of mFOL.
    [Show full text]
  • Computability and Analysis: the Legacy of Alan Turing
    Computability and analysis: the legacy of Alan Turing Jeremy Avigad Departments of Philosophy and Mathematical Sciences Carnegie Mellon University, Pittsburgh, USA [email protected] Vasco Brattka Faculty of Computer Science Universit¨at der Bundeswehr M¨unchen, Germany and Department of Mathematics and Applied Mathematics University of Cape Town, South Africa and Isaac Newton Institute for Mathematical Sciences Cambridge, United Kingdom [email protected] October 31, 2012 1 Introduction For most of its history, mathematics was algorithmic in nature. The geometric claims in Euclid’s Elements fall into two distinct categories: “problems,” which assert that a construction can be carried out to meet a given specification, and “theorems,” which assert that some property holds of a particular geometric configuration. For example, Proposition 10 of Book I reads “To bisect a given straight line.” Euclid’s “proof” gives the construction, and ends with the (Greek equivalent of) Q.E.F., for quod erat faciendum, or “that which was to be done.” arXiv:1206.3431v2 [math.LO] 30 Oct 2012 Proofs of theorems, in contrast, end with Q.E.D., for quod erat demonstran- dum, or “that which was to be shown”; but even these typically involve the construction of auxiliary geometric objects in order to verify the claim. Similarly, algebra was devoted to developing algorithms for solving equa- tions. This outlook characterized the subject from its origins in ancient Egypt and Babylon, through the ninth century work of al-Khwarizmi, to the solutions to the quadratic and cubic equations in Cardano’s Ars Magna of 1545, and to Lagrange’s study of the quintic in his R´eflexions sur la r´esolution alg´ebrique des ´equations of 1770.
    [Show full text]
  • Abraham Robinson 1918–1974
    NATIONAL ACADEMY OF SCIENCES ABRAHAM ROBINSON 1918–1974 A Biographical Memoir by JOSEPH W. DAUBEN Any opinions expressed in this memoir are those of the author and do not necessarily reflect the views of the National Academy of Sciences. Biographical Memoirs, VOLUME 82 PUBLISHED 2003 BY THE NATIONAL ACADEMY PRESS WASHINGTON, D.C. Courtesy of Yale University News Bureau ABRAHAM ROBINSON October 6, 1918–April 11, 1974 BY JOSEPH W. DAUBEN Playfulness is an important element in the makeup of a good mathematician. —Abraham Robinson BRAHAM ROBINSON WAS BORN on October 6, 1918, in the A Prussian mining town of Waldenburg (now Walbrzych), Poland.1 His father, Abraham Robinsohn (1878-1918), af- ter a traditional Jewish Talmudic education as a boy went on to study philosophy and literature in Switzerland, where he earned his Ph.D. from the University of Bern in 1909. Following an early career as a journalist and with growing Zionist sympathies, Robinsohn accepted a position in 1912 as secretary to David Wolfson, former president and a lead- ing figure of the World Zionist Organization. When Wolfson died in 1915, Robinsohn became responsible for both the Herzl and Wolfson archives. He also had become increas- ingly involved with the affairs of the Jewish National Fund. In 1916 he married Hedwig Charlotte (Lotte) Bähr (1888- 1949), daughter of a Jewish teacher and herself a teacher. 1Born Abraham Robinsohn, he later changed the spelling of his name to Robinson shortly after his arrival in London at the beginning of World War II. This spelling of his name is used throughout to distinguish Abby Robinson the mathematician from his father of the same name, the senior Robinsohn.
    [Show full text]
  • Bibliography
    BIBLIOGRAPHY [1] Abelson, Raziel, 'A Refutation of Mind-Body Identity', Philosophical Studies XXI (1970),85-89. [2] Ackerman, Wilhelm, 'BegrUndung des "tertium non datur" mittels der Hilbert­ schen Theorie der Widerspruchsfreiheit', Mathematische Annalen XCIII (1924), 1-34. [3] Anderson, Alan Ross, ed., Minds and Machines. Contemporary Perspectives in Philosophy Series. Englewood Cliffs, New Jersey: Prentice-Hall, 1964. [4] Arbib, Michael A., 'Some Comments on Self-Reproducing Automata', in Systems and Computer Science. Edited by John F. Hart and Satoru Takasu. Toronto: University of Toronto Press, 1967. [5] Baird, A. W. S., 'Pascal's Idea of Nature', Isis LXI (1970), 297-320. [6] Becker, Oskar, Beitriige zur phiinomenologischen Begrundung der Geometrie. 2, unveranderte Aufiage, Frieburg: Max Niemeyer, 1973. [7] Becker, Oskar, Mathematische Existenz: Untersuchungen zur Logik und Ontologie mathematischer Phiinomene. Freiburg: Max Niemeyer, Halle a. d. S., 1927. [8] Becker, Oskar, 'Das Symbolische in der Mathematik', in Bliitter fur Deutsche Philosophie. Bd. I, Heft. 4 (1928), 329-348. [9] Becker, Oskar, Die Grundlagen der Mathematik in Geschichtlicher Entwicklung. Freiburg: Karl Alber, 1954. [10] Bell, E. T., The Development of Mathematics. New York: McGraw-Hili, 1945. [II] Bell, John, and Machover, Moshe, A Course in Mathematical Logic. Amsterdam: North-Holland, 1974. [12] Benacerraf, Paul, 'God, the Devil, and Godel', Monist LI (1967), 9-33. [13] Benacerraf, Paul and Putnam, Hilary, eds., Philosophy of Mathematics: Selected Readings. Prentice-Hall Philosophy Series. Englewood Cliffs, New Jersey: Pren­ tice-Hail, 1964. [14] Benda, Miroslav, 'On Strong Axioms of Induction in Set Theory and Arithmetic', in Mathematical Logic in Latin America. Edited by A. Arruda, R.
    [Show full text]
  • PHIL 149 - Special Topics in Philosophy of Logic and Mathematics: Nonclassical Logic Professor Wesley Holliday Tuth 11-12:30 UC Berkeley, Fall 2018 Dwinelle 88
    PHIL 149 - Special Topics in Philosophy of Logic and Mathematics: Nonclassical Logic Professor Wesley Holliday TuTh 11-12:30 UC Berkeley, Fall 2018 Dwinelle 88 Syllabus Description A logical and philosophical exploration of alternatives to the classical logic students learn in PHIL 12A. The focus will be on intuitionistic logic, as a challenger to classical logic for reasoning in mathematics, and quantum logic, as a challenger to classical logic for reasoning about the physical world. Prerequisites PHIL 12A or equivalent. Readings All readings will be available on the bCourses site. Requirements { Weekly problem sets, due on Tuesdays in class (45% of grade) { Term paper of around 7-8 pages due December 7 on bCourses (35% of grade) { Final exam on December 12, 8-11am with location TBA (20% of grade) Class, section, and Piazza participation will be taken into account for borderline grades. For graduate students in philosophy, this course satisfies the formal philosophy course requirement. Graduate students should see Professor Holliday about assignments. Sections All enrolled students must attend a weekly discussion section with our GSI, Yifeng Ding, a PhD candidate in the Group in Logic and the Methodology of Science. Contact Prof. Holliday | [email protected] | OHs: TuTh 1-2, 246 Moses Yifeng Ding | [email protected] | OHs: Tu 2-4, 937 Evans Schedule Aug. 23 (Th) Course Overview Reading: none. 1/5 Part I: Review of Classical Logic Aug. 28 (Tu) Review of Classical Natural Deduction Videos: Prof. Holliday’s videos on natural deduction. Aug. 30 (Th) Nonconstructive Proofs Reading: Chapter 1, Section 2 of Constructivism in Mathematics by Anne Sjerp Troelstra and Dirk van Dalen.
    [Show full text]
  • Intuitionistic Logic Dirk Van Dalen
    The Blackwell Guide to Philosophica Logic. Ed. L. Gobble. Blackwell, Oxford. 2001, 224–257. Intuitionistic Logic Dirk van Dalen 1 Basic principles There are basically two ways to view intuitionistic logic: (i) as a philosoph ical–foundational issue in mathematics, (ii) as a technical discipline within mathematical logic. Let us deal with the philosophical aspects first, they will provide the motivation for the subject. In doing so, we will follow L.E.J. Brouwer, the founding father of intuitionism. Brouwer did contribute little to intuitionis- tic logic as we know it from text books and papers, but he pointed the way for his successors. Logic in Brouwer’s intuitionism takes a secondary place, the first place is reserved for mathematics. Mathematics has to be understood in the widest possible sense, it is the constructional mental activity of the individual (for a survey of the Brouwerian global philosophy of man and his mathematical enterprise, see [Dalen 1999]). The role of logic is to note and systematically study certain regularities in the mathematical constructional process. Con- trary to traditional views, logic thus is dependent on mathematics and not vice versa. Mathematical practice has taught us that relatively few logical connec- tives suffice for an efficient treatment of arguments. In the case of intu- itionism, the meaning of the connectives has to be explained in terms of the basic mathematical notion: construction. A fact A is established by means of a construction. An easy example is 3 + 2 = 5, this is established by the following construction: construct 3, construct 2 and compare the outcome with the result of the construction of 5.
    [Show full text]
  • A Perspective on the Intuitionistic Conception of Truth* Goran Sundholm
    Existence, Proof and Truth-Making: A Perspective on the Intuitionistic Conception of Truth* GOran Sundholm ABSTRACT. Truth-maker analyses construe truth as existence of which can best be seen as an attempt at giving content proof, a well-known example being that offered by Wittgenstein in to the metaphors involved in the so called correspon- the Tractatus. The paper subsumes the intuitionistic view of truth as dence theory of truth, z existence of proof under the general truth-maker scheme. Two generic constraints on truth-maker analysis are noted and positioned with In general, a truth-maker analysis is given in terms respect to the writings of Michael Dummett and the Tractatus. of three items, namely, Examination of the writings of Brouwer, Heyting and Weyl indicates (1) the (category of) truth-bearers A, the specific notions of truth-maker and existence that are at issue in the intuitionistic truth-maker analysis, namely that of proof in the (2) for each object a of the category of truth-bearers, sense of proof-object (Brouwer, Heyting) and existence in the non- a category TM a of truth-makers for A, propositional sense of a judgement abstract (Weyl). Furthermore, possible anticipations in the writings of Schlick and Pf~tnder are and finally, noted. (3) the relevant notion of existence for the category TM A . Leibniz's Satz vom Grunde provides a case in point: A true proposition is one where the predicate is contained in its Michael Dummett writes: subject, or, more generally, whose consequent is contained in its antecedent, and it is therefore necessary that there should be some From an intuitionistic standpoint .
    [Show full text]
  • Kripke Completeness of First-Order Constructive Logics with Strong Negation
    Kripke Completeness of First-Order Constructive Logics with Strong Negation ICHIRO HASUO and RYO KASHIMA, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, O-okayama, Meguro, Tokyo 152-8552, Japan. E-mail: {hasuo2, kashima}@is.titech.ac.jp Abstract This paper considers Kripke completeness of Nelson’s constructive predicate logic N3 and its several variants. N3 is an extension of intuitionistic predicate logic Int by an contructive negation operator ∼ called strong negation. The variants of N3 in consideration are by omitting the axiom A → (∼A → B), by adding the axiom of constant domain ∀x(A(x) ∨ B) →∀xA(x) ∨ B, by adding (A → B) ∨ (B → A), and by adding ¬¬(A ∨∼A); the last one we would like to call the axiom of potential omniscience and can be interpreted that we can eventually verify or falsify a statement, with proper additional information. The proofs of completeness are by the widely-applicable tree- sequent method; however, for those logics with the axiom of potential omniscience we can hardly go through with a simple application of it. For them we present two different proofs: one is by an embedding of classical logic, and the other by the TSg method, which is an extension of the tree-sequent method. Keywords: Strong Negation, Quantified Constructive Logic, Kripke-type Semantics, Intermediate Logics 1 Introduction 1.1 Strong negation Strong (or constructive) negation, denoted by ∼ in this paper, is a negation operator in constructive logics introduced by Nelson [16], Markov [15], and von Kutschera [29].1 In intuitionistic logic, the negation operator ¬A, which we would like to call Heyt- ing’s negation to make it distinct from the strong one, is an abbreviation for A →⊥, i.e.
    [Show full text]
  • Introduction
    Synthese (2011) 179:203–206 DOI 10.1007/s11229-010-9774-7 Introduction Johan van Benthem · Theo Kuipers · Henk Visser Received: 10 January 2010 / Accepted: 10 January 2010 / Published online: 31 August 2010 © The Author(s) 2010. This article is published with open access at Springerlink.com Evert Willem Beth (Almelo, July 7, 1908—Amsterdam, April 12, 1964) was the main founder of logic and formal philosophy in The Netherlands. His remarkable research career produced ground-breaking insights in the foundations of mathematics and philosophy, and his teaching inspired a generation of gifted students. Moreover, Beth’s organizational talents were instrumental in creating the Amsterdam Institute for Logic and Foundations of the Exact Sciences, the first true philosophy depart- ment in The Netherlands, and the international Division of Logic, Methodology and Philosophy of Science. This issue of Synthese pays tribute to the lasting influence of this remarkable person. J. van Benthem Amsterdam, The Netherlands T. Kuipers (B) Groningen, The Netherlands e-mail: [email protected] H. Visser Maastricht, The Netherlands 123 204 Synthese (2011) 179:203–206 Beth was trained as a philosopher, mathematician and physicist. His doctoral dis- sertation in 1935 was on the philosophy of mathematics, and he quickly became a prominent protagonist of the international scientific philosophy of the age, with math- ematical logic as its strong arm. Soon a prolific philosophical period started, resulting in original insights into the nature of scientific philosophy, the philosophy of mathe- matics, and the semantics of physical theories. Beth’s main mathematical results were found in the 1950s, in his more advanced years (a beacon of hope to the middle- aged who have not been touched by creativity yet).
    [Show full text]