Switch to: References

Add citations

You must login to add citations.
  1. Intuitionistic views on the nature of mathematics.Arend Heyting - 1974 - Synthese 27 (1-2):79 - 91.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Separating fragments of wlem, lpo, and mp.Matt Hendtlass & Robert Lubarsky - 2016 - Journal of Symbolic Logic 81 (4):1315-1343.
    Download  
     
    Export citation  
     
    Bookmark  
  • The classical continuum without points.Geoffrey Hellman & Stewart Shapiro - 2013 - Review of Symbolic Logic 6 (3):488-512.
    We develop a point-free construction of the classical one- dimensional continuum, with an interval structure based on mereology and either a weak set theory or logic of plural quantification. In some respects this realizes ideas going back to Aristotle,although, unlike Aristotle, we make free use of classical "actual infinity". Also, in contrast to intuitionistic, Bishop, and smooth infinitesimal analysis, we follow classical analysis in allowing partitioning of our "gunky line" into mutually exclusive and exhaustive disjoint parts, thereby demonstrating the independence (...)
    Download  
     
    Export citation  
     
    Bookmark   13 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  
  • Mathematical constructivism in spacetime.Geoffrey Hellman - 1998 - British Journal for the Philosophy of Science 49 (3):425-450.
    To what extent can constructive mathematics based on intuitionistc logic recover the mathematics needed for spacetime physics? Certain aspects of this important question are examined, both technical and philosophical. On the technical side, order, connectivity, and extremization properties of the continuum are reviewed, and attention is called to certain striking results concerning causal structure in General Relativity Theory, in particular the singularity theorems of Hawking and Penrose. As they stand, these results appear to elude constructivization. On the philosophical side, it (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Gleason's theorem is not constructively provable.Geoffrey Hellman - 1993 - Journal of Philosophical Logic 22 (2):193 - 203.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Constructive mathematics and quantum mechanics: Unbounded operators and the spectral theorem. [REVIEW]Geoffrey Hellman - 1993 - Journal of Philosophical Logic 22 (3):221 - 248.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Towards a theory of mathematical research programmes (II).Michael Hallett - 1979 - British Journal for the Philosophy of Science 30 (2):135-159.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • The knowing mathematician.Nicolas D. Goodman - 1984 - Synthese 60 (1):21 - 38.
    Download  
     
    Export citation  
     
    Bookmark   4 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  
  • Where is the material of the emperor's mind?David L. Gilden & Joseph S. Lappin - 1990 - Behavioral and Brain Sciences 13 (4):665-666.
    Download  
     
    Export citation  
     
    Bookmark  
  • Phenomenology and the infinite in mathematics. [REVIEW]D. A. Gillies - 1980 - British Journal for the Philosophy of Science 31 (3):289-298.
    Download  
     
    Export citation  
     
    Bookmark  
  • Karl Menger as a philosopher. [REVIEW]Donald Gillies - 1981 - British Journal for the Philosophy of Science 32 (2):183-196.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A non-classical logic for physics.Robin Giles - 1974 - Studia Logica 33 (4):397 - 415.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Strong AI and the problem of “second-order” algorithms.Gerd Gigerenzer - 1990 - Behavioral and Brain Sciences 13 (4):663-664.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The logical analysis of mathematical physics.Yvon Gauthier - 1985 - Zeitschrift Für Allgemeine Wissenschaftstheorie 16 (2):251-260.
    Die Arbeit schlägt eine beweistheoretische Analyse der mathematischen Physik im Gegensatz zu gegenwärtigen modelltheoretischen Ansätzen vor. Über eine oberflächliche Analogie hinaus haben beweistheoretische Techniken und Renormalisationsverfahren ein gemeinsames Ziel: die Ausschaltung von Unendlichkeiten in einer konsistenten Theorie. Die Geschichte der Renormalisation in Quantenfeldtheorien wird kurz skizziert und eine allgemeine These über die Natur und Justizfizierung von Theorien in der mathematischen Physik vorgeschlagen. Wir schließen mit den Grundlinien für ein Forschungsprogramm für eine physikalische Logik.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • La descente infinie, l’induction transfinie et le tiers exclu.Yvon Gauthier - 2009 - Dialogue 48 (1):1.
    ABSTRACT: It is argued that the equivalence, which is usually postulated to hold between infinite descent and transfinite induction in the foundations of arithmetic uses the law of excluded middle through the use of a double negation on the infinite set of natural numbers and therefore cannot be admitted in intuitionistic logic and mathematics, and a fortiori in more radical constructivist foundational schemes. Moreover it is shown that the infinite descent used in Dedekind-Peano arithmetic does not correspond to the infinite (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • De la logique à l’arithmétique. Pourquoi des logiques et des mathématiques constructivistes?Yvon Gauthier - 2018 - Dialogue 57 (1):1-28.
    In this article, I wish to discuss in an informal way the motivations and the motifs of the constructivist approach to logic and mathematics and by a natural extension to the general field of science, particularly theoretical physics. Foundational questions in those domains are not ruled by philosophical principles, but a critical philosophy of foundations could be the leitmotiv to the extent that it can be used as a criterion to decide between the theoretical options of scientific practices that are (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Don't ask Plato about the emperor's mind.Alan Gamham - 1990 - Behavioral and Brain Sciences 13 (4):664-665.
    Download  
     
    Export citation  
     
    Bookmark  
  • Working foundations.Solomon Feferman - 1985 - Synthese 62 (2):229 - 254.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Intensionality in mathematics.Solomon Feferman - 1985 - Journal of Philosophical Logic 14 (1):41 - 55.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Infinite sets that Satisfy the Principle of Omniscience in any Variety of Constructive Mathematics.Martín H. Escardó - 2013 - Journal of Symbolic Logic 78 (3):764-784.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • 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  
  • Physics of brain-mind interaction.John C. Eccles - 1990 - Behavioral and Brain Sciences 13 (4):662-663.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computations over abstract categories of representation.Roy Eagleson - 1990 - Behavioral and Brain Sciences 13 (4):661-662.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Perceptive questions about computation and cognition.Jon Doyle - 1990 - Behavioral and Brain Sciences 13 (4):661-661.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Elements of Intuitionistic Analysis II the Stone‐Weierstrass Theorem and Ascoli's Theorem.H. de Swart - 1976 - Mathematical Logic Quarterly 22 (1):501-508.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Elements of Intuitionistic Analysis. Rolle's Theorem and Complete, Totally bounded, Metric Spaces.H. de Swart - 1976 - Mathematical Logic Quarterly 22 (1):289-298.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Elements of Intuitionistic Analysis II the Stone-Weierstrass Theorem and Ascoli's Theorem.H. de Swart - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):501-508.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Elements of Intuitionistic Analysis. Rolle's Theorem and Complete, Totally bounded, Metric Spaces.H. de Swart - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):289-298.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the imaginative constructivist nature of design: a theoretical approach.Akin Osman Kazakci - unknown
    Most empirical accounts of design suggest that designing is an activity where objects and representations are progressively constructed. Despite this fact, whether design is a constructive process or not is not a question directly addressed in the current design research. By contrast, in other fields such as Mathematics or Psychology, the notion of constructivism is seen as a foundational issue. The present paper defends the point of view that forms of constructivism in design need to be identified and integrated as (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • About and Around Computing Over the Reals.Solomon Feferman - unknown
    1. One theory or many? In 2004 a very interesting and readable article by Lenore Blum, entitled “Computing over the reals: Where Turing meets Newton,” appeared in the Notices of the American Mathematical Society. It explained a basic model of computation over the reals due to Blum, Michael Shub and Steve Smale (1989), subsequently exposited at length in their influential book, Complexity and Real Computation (1997), coauthored with Felipe Cucker. The ‘Turing’ in the title of Blum’s article refers of course (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Decidability of Scott's Model as an Ordered $\mathbb{Q}$-Vectorspace.Miklós Erdélyi-Szabó - 1997 - Journal of Symbolic Logic 62 (3):917-924.
    Let $L = \langle, +, h_q, 1\rangle_{q \in \mathbb{Q}}$ where $\mathbb{Q}$ is the set of rational numbers and $h_q$ is a one-place function symbol corresponding to multiplication by $q$. Then the $L$-theory of Scott's model for intuitionistic analysis is decidable.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Interpreting descriptions in intensional type theory.Jesper Carlström - 2005 - Journal of Symbolic Logic 70 (2):488-514.
    Natural deduction systems with indefinite and definite descriptions are presented, and interpreted in Martin-Löf's intensional type theory. The interpretations are formalizations of ideas which are implicit in the literature of constructive mathematics: if we have proved that an element with a certain property exists, we speak of ‘the element such that the property holds' and refer by that phrase to the element constructed in the existence proof. In particular, we deviate from the practice of interpreting descriptions by contextual definitions.
    Download  
     
    Export citation  
     
    Bookmark   2 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  
  • 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  
  • An Objection to Naturalism and Atheism from Logic.Christopher Gregory Weaver - 2019 - In Graham Oppy (ed.), Blackwell Companion to Atheism and Philosophy. Malden: Blackwell Publishers. 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  
  • Philosophy of Quantum Probability - An empiricist study of its formalism and logic.Ronnie Hermens - unknown
    The use of probability theory is widespread in our daily life as well as in scientific theories. In virtually all cases, calculations can be carried out within the framework of classical probability theory. A special exception is given by quantum mechanics, which gives rise to a new probability theory: quantum probability theory. This dissertation deals with the question of how this formalism can be understood from a philosophical and physical perspective. The dissertation is divided into three parts. In the first (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Deductive Pluralism.John M. Hosack - unknown
    This paper proposes an approach to the philosophy of mathematics, deductive pluralism, that is designed to satisfy the criteria of inclusiveness of and consistency with mathematical practice. Deductive pluralism views mathematical statements as assertions that a result follows from logical and mathematical foundations and that there are a variety of incompatible foundations such as standard foundations, constructive foundations, or univalent foundations. The advantages of this philosophy include the elimination of ontological problems, epistemological clarity, and objectivity. Possible objections and relations with (...)
    Download  
     
    Export citation  
     
    Bookmark