Switch to: References

Add citations

You must login to add citations.
  1. Mathematical and Moral Disagreement.Silvia Jonas - 2020 - Philosophical Quarterly 70 (279):302-327.
    The existence of fundamental moral disagreements is a central problem for moral realism and has often been contrasted with an alleged absence of disagreement in mathematics. However, mathematicians do in fact disagree on fundamental questions, for example on which set-theoretic axioms are true, and some philosophers have argued that this increases the plausibility of moral vis-à-vis mathematical realism. I argue that the analogy between mathematical and moral disagreement is not as straightforward as those arguments present it. In particular, I argue (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Possibilities, models, and intuitionistic logic: Ian Rumfitt’s The boundary stones of thought.Stewart Shapiro - 2019 - Inquiry: An Interdisciplinary Journal of Philosophy 62 (7):812-825.
    ABSTRACTAIan Rumfitt's new book presents a distinctive and intriguing philosophy of logic, one that ultimately settles on classical logic as the uniquely correct one–or at least rebuts some prominent arguments against classical logic. The purpose of this note is to evaluate Rumfitt's perspective by focusing on some themes that have occupied me for some time: the role and importance of model theory and, in particular, the place of counter-arguments in establishing invalidity, higher-order logic, and the logical pluralism/relativism articulated in my (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Enciclopédia de Termos Lógico-Filosóficos.João Miguel Biscaia Branquinho, Desidério Murcho & Nelson Gonçalves Gomes (eds.) - 2006 - São Paulo, SP, Brasil: Martins Fontes.
    Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Labyrinth of Continua.Patrick Reeder - 2018 - Philosophia Mathematica 26 (1):1-39.
    This is a survey of the concept of continuity. Efforts to explicate continuity have produced a plurality of philosophical conceptions of continuity that have provably distinct expressions within contemporary mathematics. I claim that there is a divide between the conceptions that treat the whole continuum as prior to its parts, and those conceptions that treat the parts of the continuum as prior to the whole. Along this divide, a tension emerges between those conceptions that favor philosophical idealizations of continuity and (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • An Objection to Naturalism and Atheism from Logic.Christopher Gregory Weaver - 2019 - In Graham Oppy (ed.), A Companion to Atheism and Philosophy. Hoboken: Blackwell. pp. 451-475.
    I proffer a success argument for classical logical consequence. I articulate in what sense that notion of consequence should be regarded as the privileged notion for metaphysical inquiry aimed at uncovering the fundamental nature of the world. Classical logic breeds necessitism. I use necessitism to produce problems for both ontological naturalism and atheism.
    Download  
     
    Export citation  
     
    Bookmark  
  • What is a Higher Level Set?Dimitris Tsementzis - 2016 - Philosophia Mathematica:nkw032.
    Structuralist foundations of mathematics aim for an ‘invariant’ conception of mathematics. But what should be their basic objects? Two leading answers emerge: higher groupoids or higher categories. I argue in favor of the former over the latter. First, I explain why to choose between them we need to ask the question of what is the correct ‘categorified’ version of a set. Second, I argue in favor of groupoids over categories as ‘categorified’ sets by introducing a pre-formal understanding of groupoids as (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • What are the limits of mathematical explanation? Interview with Charles McCarty by Piotr Urbańczyk.David Charles McCarty & Piotr Urbańczyk - 2016 - Zagadnienia Filozoficzne W Nauce 60:119-137.
    An interview with Charles McCarty by Piotr Urbańczyk concerning mathematical explanation.
    Download  
     
    Export citation  
     
    Bookmark  
  • Feng Ye. Strict Finitism and the Logic of Mathematical Applications.Nigel Vinckier & Jean Paul Van Bendegem - 2016 - Philosophia Mathematica 24 (2):247-256.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Criterion for Compactness in Metric Spaces?Douglas S. Bridges - 1979 - Mathematical Logic Quarterly 25 (7-12):97-98.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Objectivity of Mathematics.Stewart Shapiro - 2007 - Synthese 156 (2):337-381.
    The purpose of this paper is to apply Crispin Wright’s criteria and various axes of objectivity to mathematics. I test the criteria and the objectivity of mathematics against each other. Along the way, various issues concerning general logic and epistemology are encountered.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Rings and Fields, a Constructive View.Daniel A. Romano - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):25-40.
    Download  
     
    Export citation  
     
    Bookmark  
  • Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.Corey Edward Mulvihill - 2015 - Dissertation, University of Waterloo
    Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Steadfast intentions.Keith K. Niall - 1990 - Behavioral and Brain Sciences 13 (4):679-680.
    Download  
     
    Export citation  
     
    Bookmark  
  • Systematic, unconscious thought is the place to anchor quantum mechanics in the mind.Thomas Roeper - 1990 - Behavioral and Brain Sciences 13 (4):681-682.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computability, consciousness, and algorithms.Robert Wilensky - 1990 - Behavioral and Brain Sciences 13 (4):690-691.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • On “seeing” the truth of the Gödel sentence.George Boolos - 1990 - Behavioral and Brain Sciences 13 (4):655-656.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Algorithms and physical laws.Franklin Boyle - 1990 - Behavioral and Brain Sciences 13 (4):656-657.
    Download  
     
    Export citation  
     
    Bookmark  
  • Is mathematical insight algorithmic?Martin Davis - 1990 - Behavioral and Brain Sciences 13 (4):659-660.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Why you'll never know whether Roger Penrose is a computer.Clark Glymour & Kevin Kelly - 1990 - Behavioral and Brain Sciences 13 (4):666-667.
    Download  
     
    Export citation  
     
    Bookmark  
  • Selecting for the con in consciousness.Deborah Hodgkin & Alasdair I. Houston - 1990 - Behavioral and Brain Sciences 13 (4):668-669.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Time-delays in conscious processes.Benjamin Libet - 1990 - Behavioral and Brain Sciences 13 (4):672-672.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Uniformly convex Banach spaces are reflexive—constructively.Douglas S. Bridges, Hajime Ishihara & Maarten McKubre-Jordens - 2013 - Mathematical Logic Quarterly 59 (4-5):352-356.
    We propose a natural definition of what it means in a constructive context for a Banach space to be reflexive, and then prove a constructive counterpart of the Milman-Pettis theorem that uniformly convex Banach spaces are reflexive.
    Download  
     
    Export citation  
     
    Bookmark  
  • Finitary sequence spaces.Mark Mandelkern - 1993 - Mathematical Logic Quarterly 39 (1):416-430.
    This paper studies the metric structure of the space Hr of absolutely summable sequences of real numbers with at most r nonzero terms. Hr is complete, and is located and nowhere dense in the space of all absolutely summable sequences. Totally bounded and compact subspaces of Hr are characterized, and large classes of located, totally bounded, compact, and locally compact subspaces are constructed. The methods used are constructive in the strict sense. MSC: 03F65, 54E50.
    Download  
     
    Export citation  
     
    Bookmark  
  • Open subspaces of locally compact metric spaces.Mark Mandelkern - 1993 - Mathematical Logic Quarterly 39 (1):213-216.
    Although classically every open subspace of a locally compact space is also locally compact, constructively this is not generally true. This paper provides a locally compact remetrization for an open set in a compact metric space and constructs a one-point compactification. MSC: 54D45, 03F60, 03F65.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Construction of An Equality Relation on a Set with Coequality Relation.Daniel A. Romano - 1989 - Mathematical Logic Quarterly 35 (6):515-516.
    Download  
     
    Export citation  
     
    Bookmark  
  • Quotient Completion for the Foundation of Constructive Mathematics.Maria Emilia Maietti & Giuseppe Rosolini - 2013 - Logica Universalis 7 (3):371-402.
    We apply some tools developed in categorical logic to give an abstract description of constructions used to formalize constructive mathematics in foundations based on intensional type theory. The key concept we employ is that of a Lawvere hyperdoctrine for which we describe a notion of quotient completion. That notion includes the exact completion on a category with weak finite limits as an instance as well as examples from type theory that fall apart from this.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Mathematical Knowledge and Pattern Cognition.Michael D. Resnik - 1975 - Canadian Journal of Philosophy 5 (1):25 - 39.
    This paper is concerned with the genesis of mathematical knowledge. While some philosophers might argue that mathematics has no real subject matter and thus is not a body of knowledge, I will not try to dissuade them directly. I shall not attempt such a refutation because it seems clear to me that mathematicians do know such things as the Mean Value Theorem, The Fundamental Theorem of Arithmetic, Godel's Theorems, etc. Moreover, this is much more evident to me than any philosophical (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Logical Pluralism.Jc Beall & Greg Restall - 2005 - Oxford, England: Oxford University Press. Edited by Greg Restall.
    Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...)
    Download  
     
    Export citation  
     
    Bookmark   246 citations  
  • Paradoxes.John Myhill - 1984 - Synthese 60 (1):129 - 143.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Working foundations.Solomon Feferman - 1985 - Synthese 62 (2):229 - 254.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Building infinite machines.E. B. Davies - 2001 - British Journal for the Philosophy of Science 52 (4):671-682.
    We describe in some detail how to build an infinite computing machine within a continuous Newtonian universe. The relevance of our construction to the Church-Turing thesis and the Platonist-Intuitionist debate about the nature of mathematics is also discussed.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Countable choice as a questionable uniformity principle.Peter M. Schuster - 2004 - Philosophia Mathematica 12 (2):106-134.
    Should weak forms of the axiom of choice really be accepted within constructive mathematics? A critical view of the Brouwer-Heyting-Kolmogorov interpretation, accompanied by the intention to include nondeterministic algorithms, leads us to subscribe to Richman's appeal for dropping countable choice. As an alternative interpretation of intuitionistic logic, we propose to renew dialogue semantics.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Developments in constructive nonstandard analysis.Erik Palmgren - 1998 - Bulletin of Symbolic Logic 4 (3):233-272.
    We develop a constructive version of nonstandard analysis, extending Bishop's constructive analysis with infinitesimal methods. A full transfer principle and a strong idealisation principle are obtained by using a sheaf-theoretic construction due to I. Moerdijk. The construction is, in a precise sense, a reduced power with variable filter structure. We avoid the nonconstructive standard part map by the use of nonstandard hulls. This leads to an infinitesimal analysis which includes nonconstructive theorems such as the Heine-Borel theorem, the Cauchy-Peano existence theorem (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Why do mathematicians re-prove theorems?John W. Dawson Jr - 2006 - Philosophia Mathematica 14 (3):269-286.
    From ancient times to the present, the discovery and presentation of new proofs of previously established theorems has been a salient feature of mathematical practice. Why? What purposes are served by such endeavors? And how do mathematicians judge whether two proofs of the same theorem are essentially different? Consideration of such questions illuminates the roles that proofs play in the validation and communication of mathematical knowledge and raises issues that have yet to be resolved by mathematical logicians. The Appendix, in (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Real analysis without classes.Geoffrey Hellman - 1994 - Philosophia Mathematica 2 (3):228-250.
    This paper explores strengths and limitations of both predicativism and nominalism, especially in connection with the problem of characterizing the continuum. Although the natural number structure can be recovered predicatively (despite appearances), no predicative system can characterize even the full predicative continuum which the classicist can recognize. It is shown, however, that the classical second-order theory of continua (third-order number theory) can be recovered nominalistically, by synthesizing mereology, plural quantification, and a modal-structured approach with essentially just the assumption that an (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A general formulation of simultaneous inductive-recursive definitions in type theory.Peter Dybjer - 2000 - Journal of Symbolic Logic 65 (2):525-549.
    The first example of a simultaneous inductive-recursive definition in intuitionistic type theory is Martin-Löf's universe á la Tarski. A set U 0 of codes for small sets is generated inductively at the same time as a function T 0 , which maps a code to the corresponding small set, is defined by recursion on the way the elements of U 0 are generated. In this paper we argue that there is an underlying general notion of simultaneous inductive-recursive definition which is (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Can constructive mathematics be applied in physics?Douglas S. Bridges - 1999 - Journal of Philosophical Logic 28 (5):439-453.
    The nature of modern constructive mathematics, and its applications, actual and potential, to classical and quantum physics, are discussed.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Logical pluralism.Jc Beall & Greg Restall - 2000 - Australasian Journal of Philosophy 78 (4):475 – 493.
    Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...)
    Download  
     
    Export citation  
     
    Bookmark   305 citations  
  • Bishop's Lemma.Hannes Diener & Matthew Hendtlass - 2018 - Mathematical Logic Quarterly 64 (1-2):49-54.
    Bishop's Lemma is a centrepiece in the development of constructive analysis. We show that its proof requires some form of the axiom of choice; and that the completeness requirement in Bishop's Lemma can be weakened and that there is a vast class of non‐complete spaces that Bishop's Lemma applies to.
    Download  
     
    Export citation  
     
    Bookmark  
  • In Memoriam: Solomon Feferman (1928–2016).Charles Parsons & Wilfried Sieg - 2017 - Bulletin of Symbolic Logic 23 (3):337-344.
    Download  
     
    Export citation  
     
    Bookmark  
  • Geometric Intuition and Elementary Constructive Analysis.Douglas S. Bridges - 1979 - Mathematical Logic Quarterly 25 (33):521-523.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A New Approach to Constructive Topology and Measure Theory.A. K. Khalifa - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (6):539-550.
    Download  
     
    Export citation  
     
    Bookmark  
  • Proofs and Retributions, Or: Why Sarah Can’t Take Limits.Vladimir Kanovei, Karin U. Katz, Mikhail G. Katz & Mary Schaps - 2015 - Foundations of Science 20 (1):1-25.
    The small, the tiny, and the infinitesimal have been the object of both fascination and vilification for millenia. One of the most vitriolic reviews in mathematics was that written by Errett Bishop about Keisler’s book Elementary Calculus: an Infinitesimal Approach. In this skit we investigate both the argument itself, and some of its roots in Bishop George Berkeley’s criticism of Leibnizian and Newtonian Calculus. We also explore some of the consequences to students for whom the infinitesimal approach is congenial. The (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Penrose's grand unified mystery.David Waltz & James Pustejovsky - 1990 - Behavioral and Brain Sciences 13 (4):688-690.
    Download  
     
    Export citation  
     
    Bookmark  
  • Minds beyond brains and algorithms.Jan M. Zytkow - 1990 - Behavioral and Brain Sciences 13 (4):691-692.
    Download  
     
    Export citation  
     
    Bookmark  
  • Betting your life on an algorithm.Daniel C. Dennett - 1990 - Behavioral and Brain Sciences 13 (4):660-661.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Noncomputability, unpredictability, undecidability, and unsolvability in economic and finance theories.Ying-Fang Kao, V. Ragupathy, K. Vela Velupillai & Stefano Zambelli - 2013 - Complexity 18 (1):51-55.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Decidability in the Constructive Theory of Reals as an Ordered ℚ‐vectorspace.Miklós Erdélyi-Szabó - 1997 - Mathematical Logic Quarterly 43 (3):343-354.
    We show that various fragments of the intuitionistic/constructive theory of the reals are decidable.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Abstract Data Types and Type Theory: Theories as Types.Ruy J. G. B. de Queiroz & Thomas S. E. Maibaum - 1991 - Mathematical Logic Quarterly 37 (9‐12):149-166.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • An omniscience principle, the König Lemma and the Hahn‐Banach theorem.Hajime Ishihara - 1990 - Mathematical Logic Quarterly 36 (3):237-240.
    Download  
     
    Export citation  
     
    Bookmark   14 citations