Switch to: References

Add citations

You must login to add citations.
  1. Seeing truth or just seeming true?Adina Roskies - 1990 - Behavioral and Brain Sciences 13 (4):682-683.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Computability, consciousness, and algorithms.Robert Wilensky - 1990 - Behavioral and Brain Sciences 13 (4):690-691.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Physics of brain-mind interaction.John C. Eccles - 1990 - Behavioral and Brain Sciences 13 (4):662-663.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Weak-operator Continuity and the Existence of Adjoints.Douglas Bridges & Luminita Dediu - 1999 - Mathematical Logic Quarterly 45 (2):203-206.
    It is shown, within constructive mathematics, that the unit ball B1 of the set of bounded operators on a Hilbert space H is weak-operator totally bounded. This result is then used to prove that the weak-operator continuity of the mapping T → AT on B1 is equivalent to the existence of the adjoint of A.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • 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  
  • 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  
  • Powers of positive elements in C *-algebras.Hiroki Takamura - 2011 - Mathematical Logic Quarterly 57 (5):481-484.
    In this paper, we show that Ogasawa’s theorem has a proof in Bishop style constructive mathematics . In 25, we introduced the elementary constructive theory of C*-algebras in BISH, but we did not discuss the powers of positive elements there. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Download  
     
    Export citation  
     
    Bookmark  
  • Complements of Intersections in Constructive Mathematics.Douglas S. Bridges & Hajime Ishihara - 1994 - Mathematical Logic Quarterly 40 (1):35-43.
    We examine, from a constructive perspective, the relation between the complements of S, T, and S ∩ T in X, where X is either a metric space or a normed linear space. The fundamental question addressed is: If x is distinct from each element of S ∩ T, if s ϵ S, and if t ϵ T, is x distinct from s or from t? Although the classical answer to this question is trivially affirmative, constructive answers involve Markov's principle and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (2 other versions)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  
  • A Definitive Constructive Open Mapping Theorem?Douglas Bridges & Hajime Ishihara - 1998 - Mathematical Logic Quarterly 44 (4):545-552.
    It is proved, within Bishop's constructive mathematics , that, in the context of a Hilbert space, the Open Mapping Theorem is equivalent to a principle that holds in intuitionistic mathematics and recursive constructive mathematics but is unlikely to be provable within BISH.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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   11 citations  
  • 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   14 citations  
  • Toward a constructive theory of unbounded linear operators.Feng Ye - 2000 - Journal of Symbolic Logic 65 (1):357-370.
    We show that the following results in the classical theory of unbounded linear operators on Hilbert spaces can be proved within the framework of Bishop's constructive mathematics: the Kato-Rellich theorem, the spectral theorem, Stone's theorem, and the self-adjointness of the most common quantum mechanical operators, including the Hamiltonians of electro-magnetic fields with some general forms of potentials.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (2 other versions)A constructive look at the completeness of the space (ℝ).Hajime Ishihara & Satoru Yoshida - 2002 - Journal of Symbolic Logic 67 (4):1511-1519.
    We show, within the framework of Bishop's constructive mathematics, that (sequential) completeness of the locally convex space $\mathcal{D} (\mathbb{R})$ of test functions is equivalent to the principle BD-N which holds in classical mathemtatics, Brouwer's intuitionism and Markov's constructive recursive mathematics, but does not hold in Bishop's constructivism.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A non-classical logic for physics.Robin Giles - 1974 - Studia Logica 33 (4):397 - 415.
    Download  
     
    Export citation  
     
    Bookmark   27 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   302 citations  
  • 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  
  • 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  
  • 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  
  • (1 other version)A theorem on cocongruence of rings.Daniel A. Romano - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (1):87-88.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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   11 citations  
  • 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  
  • Brouwer versus Hilbert: 1907–1928.J. Posy Carl - 1998 - Science in Context 11 (2):291-325.
    The ArgumentL. E. J. Brouwer and David Hubert, two titans of twentieth-century mathematics, clashed dramatically in the 1920s. Though they were both Kantian constructivists, their notoriousGrundlagenstreitcentered on sharp differences about the foundations of mathematics: Brouwer was prepared to revise the content and methods of mathematics (his “Intuitionism” did just that radically), while Hilbert's Program was designed to preserve and constructively secure all of classical mathematics.Hilbert's interests and polemics at the time led to at least three misconstruals of intuitionism, misconstruals which (...)
    Download  
     
    Export citation  
     
    Bookmark   3 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  
  • Betting your life on an algorithm.Daniel C. Dennett - 1990 - Behavioral and Brain Sciences 13 (4):660-661.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Perceptive questions about computation and cognition.Jon Doyle - 1990 - Behavioral and Brain Sciences 13 (4):661-661.
    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  
  • Uncertainty about quantum mechanics.Mark S. Madsen - 1990 - Behavioral and Brain Sciences 13 (4):674-675.
    Download  
     
    Export citation  
     
    Bookmark  
  • The nonalgorithmic mind.Roger Penrose - 1990 - Behavioral and Brain Sciences 13 (4):692-705.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Penrose's grand unified mystery.David Waltz & James Pustejovsky - 1990 - Behavioral and Brain Sciences 13 (4):688-690.
    Download  
     
    Export citation  
     
    Bookmark  
  • Étude constructive de problèmes de topologie pour les réels irrationnels.Mohamed Khalouani, Salah Labhalla & Et Henri Lombardi - 1999 - Mathematical Logic Quarterly 45 (2):257-288.
    We study in a constructive manner some problems of topology related to the set Irr of irrational reals. The constructive approach requires a strong notion of an irrational number; constructively, a real number is irrational if it is clearly different from any rational number. We show that the set Irr is one-to-one with the set Dfc of infinite developments in continued fraction . We define two extensions of Irr, one, called Dfc1, is the set of dfc of rationals and irrationals (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Kripke schema in metric topology.Robert Lubarsky, Fred Richman & Peter Schuster - 2012 - Mathematical Logic Quarterly 58 (6):498-501.
    A form of Kripke's schema turns out to be equivalent to each of the following two statements from metric topology: every open subspace of a separable metric space is separable; every open subset of a separable metric space is a countable union of open balls. Thus Kripke's schema serves as a point of reference for classifying theorems of classical mathematics within Bishop-style constructive reverse mathematics.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • 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  
  • (1 other version)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  
  • Structures and Logics: A Case for (a) Relativism.Stewart Shapiro - 2014 - Erkenntnis 79 (2):309-329.
    In this paper, I use the cases of intuitionistic arithmetic with Church’s thesis, intuitionistic analysis, and smooth infinitesimal analysis to argue for a sort of pluralism or relativism about logic. The thesis is that logic is relative to a structure. There are classical structures, intuitionistic structures, and (possibly) paraconsistent structures. Each such structure is a legitimate branch of mathematics, and there does not seem to be an interesting logic that is common to all of them. One main theme of my (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • 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  
  • Analysis without actual infinity.Jan Mycielski - 1981 - Journal of Symbolic Logic 46 (3):625-633.
    We define a first-order theory FIN which has a recursive axiomatization and has the following two properties. Each finite part of FIN has finite models. FIN is strong enough to develop that part of mathematics which is used or has potential applications in natural science. This work can also be regarded as a consistency proof of this hitherto informal part of mathematics. In FIN one can count every set; this permits one to prove some new probabilistic theorems.
    Download  
     
    Export citation  
     
    Bookmark   16 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  
  • Continuity properties in constructive mathematics.Hajime Ishihara - 1992 - Journal of Symbolic Logic 57 (2):557-565.
    The purpose of this paper is an axiomatic study of the interrelations between certain continuity properties. We deal with principles which are equivalent to the statements "every mapping is sequentially nondiscontinuous", "every sequentially nondiscontinuous mapping is sequentially continuous", and "every sequentially continuous mapping is continuous". As corollaries, we show that every mapping of a complete separable space is continuous in constructive recursive mathematics (the Kreisel-Lacombe-Schoenfield-Tsejtin theorem) and in intuitionism.
    Download  
     
    Export citation  
     
    Bookmark   18 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   11 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  
  • 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  
  • Nick Haverkamp. Intuitionism vs. Classicism: A Mathematical Attack on Classical Logic. Studies in Theoretical Philosophy, Vol. 2. Frankfurt: Klostermann, 2015. ISBN 978-3-465-03906-8 . Pp. xvi + 270. [REVIEW]Fred Richman - 2016 - Philosophia Mathematica 24 (2):278-278.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computation and consciousness.Drew McDermott - 1990 - Behavioral and Brain Sciences 13 (4):676-678.
    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