Switch to: References

Citations of:

Points and Spaces

Journal of Symbolic Logic 34 (3):519-519 (1969)

Add citations

You must login to add citations.
  1. Constructivity and Computability in Historical and Philosophical Perspective.Jacques Dubucs & Michel Bourdeau (eds.) - 2014 - Dordrecht, Netherland: Springer.
    Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Different Ways of Being Equal.Bruno Bentzen - 2020 - Erkenntnis 87 (4):1809-1830.
    The aim of this paper is to present a constructive solution to Frege's puzzle (largely limited to the mathematical context) based on type theory. Two ways in which an equality statement may be said to have cognitive significance are distinguished. One concerns the mode of presentation of the equality, the other its mode of proof. Frege's distinction between sense and reference, which emphasizes the former aspect, cannot adequately explain the cognitive significance of equality statements unless a clear identity criterion for (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • 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  
  • An intuitionistic proof of Kruskal’s theorem.Wim Veldman - 2004 - Archive for Mathematical Logic 43 (2):215-264.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Shaping the Enemy: Foundational Labelling by L.E.J. Brouwer and A. Heyting.Miriam Franchella - 2018 - History and Philosophy of Logic 40 (2):152-181.
    The use of the three labels to denote the three foundational schools of the early twentieth century are now part of literature. Yet, neither their number nor the...
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Brouwer's constructivism.Carl J. Posy - 1974 - Synthese 27 (1-2):125 - 159.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Two simple sets that are not positively Borel.Wim Veldman - 2005 - Annals of Pure and Applied Logic 135 (1-3):151-209.
    The author proved in his Ph.D. Thesis [W. Veldman, Investigations in intuitionistic hierarchy theory, Ph.D. Thesis, Katholieke Universiteit Nijmegen, 1981] that, in intuitionistic analysis, the positively Borel subsets of Baire space form a genuinely growing hierarchy: every level of the hierarchy contains sets that do not occur at any lower level. It follows from this result that there are natural examples of analytic and also of co-analytic sets that are not positively Borel. It turns out, however, that, in intuitionistic analysis, (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The logic of brouwer and heyting.Joan Rand Moschovakis - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 77-125.
    Download  
     
    Export citation  
     
    Bookmark  
  • Brouwer’s Weak Counterexamples and the Creative Subject: A Critical Survey.Peter Fletcher - 2020 - Journal of Philosophical Logic 49 (6):1111-1157.
    I survey Brouwer’s weak counterexamples to classical theorems, with a view to discovering what useful mathematical work is done by weak counterexamples; whether they are rigorous mathematical proofs or just plausibility arguments; the role of Brouwer’s notion of the creative subject in them, and whether the creative subject is really necessary for them; what axioms for the creative subject are needed; what relation there is between these arguments and Brouwer’s theory of choice sequences. I refute one of Brouwer’s claims with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Realizing Brouwer's sequences.Richard E. Vesley - 1996 - Annals of Pure and Applied Logic 81 (1-3):25-74.
    When Kleene extended his recursive realizability interpretation from intuitionistic arithmetic to analysis, he was forced to use more than recursive functions to interpret sequences and conditional constructions. In fact, he used what classically appears to be the full continuum. We describe here a generalization to higher type of Kleene's realizability, one case of which, -realizability, uses general recursive functions throughout, both to realize theorems and to interpret choice sequences. -realizability validates a version of the bar theorem and the usual continuity (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A transfer theorem in constructive p-adic algebra.Deirdre Haskell - 1992 - Annals of Pure and Applied Logic 58 (1):29-55.
    The main result of this paper is a transfer theorem which describes the relationship between constructive validity and classical validity for a class of first-order sentences over the p-adics. The proof of one direction of the theorem uses a principle of intuitionism; the proof of the other direction is classically valid. Constructive verifications of known properties of the p-adics are indicated. In particular, the existence of cylindric algebraic decompositions for the p-adics is used.
    Download  
     
    Export citation  
     
    Bookmark  
  • Paradox and Potential Infinity.Charles McCarty - 2013 - Journal of Philosophical Logic 42 (1):195-219.
    We describe a variety of sets internal to models of intuitionistic set theory that (1) manifest some of the crucial behaviors of potentially infinite sets as described in the foundational literature going back to Aristotle, and (2) provide models for systems of predicative arithmetic. We close with a brief discussion of Church’s Thesis for predicative arithmetic.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Brouwer’s Notion of ‘Egoicity’.Ivan Restović - 2022 - Axiomathes 32 (1):83-100.
    According to Brouwer’s ‘theory of the exodus of consciousness’, our experience includes ‘egoicity’, a distinct kind of feeling. In this paper, we describe his phenomenology in order to explore and elaborate on the notion of egoic sensations. In the world of perception formed from sensations, some of them are, Brouwer claims, not completely separated or ‘estranged’ from the subject, which is to say they have a certain degree of egoicity. We claim this phenomenon can be explained in terms of the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Formal systems for some branches of intuitionistic analysis.G. Kreisel - 1970 - Annals of Mathematical Logic 1 (3):229.
    Download  
     
    Export citation  
     
    Bookmark   50 citations