Switch to: References

Add citations

You must login to add citations.
  1. Choice sequences and informal rigour.A. S. Troelstra - 1985 - Synthese 62 (2):217 - 227.
    In this paper we discuss a particular example of the passage from the informal, but rigorous description of a concept to the axiomatic formulation of principles holding for the concept; in particular, we look at the principles of continuity and lawlike choice in the theory of lawless sequences. Our discussion also leads to a better understanding of the rôle of the so-called density axiom for lawless sequences.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Hermann Weyl's intuitionistic mathematics.Dirk van Dalen - 1995 - Bulletin of Symbolic Logic 1 (2):145-169.
    Dedicated to Dana Scott on his sixtieth birthday.It is common knowledge that for a short while Hermann Weyl joined Brouwer in his pursuit of a revision of mathematics according to intuitionistic principles. There is, however, little in the literature that sheds light on Weyl's role and in particular on Brouwer's reaction to Weyl's allegiance to the cause of intuitionism. This short episode certainly raises a number of questions: what made Weyl give up his own program, spelled out in “Das Kontinuum”, (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Arguments for the continuity principle.Mark van Atten & Dirk van Dalen - 2002 - Bulletin of Symbolic Logic 8 (3):329-347.
    There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Analysing choice sequences.A. S. Troelstra - 1983 - Journal of Philosophical Logic 12 (2):197 - 260.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Paraconsistent Metatheory: New Proofs with Old Tools.Guillermo Badia, Zach Weber & Patrick Girard - 2022 - Journal of Philosophical Logic 51 (4):825-856.
    This paper is a step toward showing what is achievable using non-classical metatheory—particularly, a substructural paraconsistent framework. What standard results, or analogues thereof, from the classical metatheory of first order logic can be obtained? We reconstruct some of the originals proofs for Completeness, Löwenheim-Skolem and Compactness theorems in the context of a substructural logic with the naive comprehension schema. The main result is that paraconsistent metatheory can ‘re-capture’ versions of standard theorems, given suitable restrictions and background assumptions; but the shift (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Sheaf models for choice sequences.Gerrit Van Der Hoeven & Ieke Moerdijk - 1984 - Annals of Pure and Applied Logic 27 (1):63-107.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Arguments for the Continuity Principle.Mark Van Atten & Dirk Van Dalen - 2002 - Bulletin of Symbolic Logic 8 (3):329 - 347.
    There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Untersuchungen über den Einstelligen Intuitionistischen Prädikatenkalkül der Ersten Stufe.Jekeri Okee - 1972 - Mathematical Logic Quarterly 18 (1-3):37-48.
    Download  
     
    Export citation  
     
    Bookmark  
  • Reflexive Intermediate Propositional Logics.Nathan C. Carter - 2006 - Notre Dame Journal of Formal Logic 47 (1):39-62.
    Which intermediate propositional logics can prove their own completeness? I call a logic reflexive if a second-order metatheory of arithmetic created from the logic is sufficient to prove the completeness of the original logic. Given the collection of intermediate propositional logics, I prove that the reflexive logics are exactly those that are at least as strong as testability logic, that is, intuitionistic logic plus the scheme $\neg φ ∨ \neg\neg φ. I show that this result holds regardless of whether Tarskian (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • An interpretation of intuitionistic analysis.D. van Dalen - 1978 - Annals of Mathematical Logic 13 (1):1.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Formal systems for some branches of intuitionistic analysis.G. Kreisel - 1970 - Annals of Mathematical Logic 1 (3):229.
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • Arguments for the Continuity Principle. [REVIEW]Mark van Atten & Dirk van Dalen - 2002 - Bulletin of Symbolic Logic 8 (3):329-347.
    There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation