Switch to: Citations

Add references

You must login to add references.
  1. Nicht konstruktiv beweisbare sätze der analysis.Ernst Specker - 1949 - Journal of Symbolic Logic 14 (3):145-158.
  • The anti-Specker property, positivity, and total boundedness.Douglas Bridges & Hannes Diener - 2010 - Mathematical Logic Quarterly 56 (4):434-441.
    Working within Bishop-style constructive mathematics, we examine some of the consequences of the anti-Specker property, known to be equivalent to a version of Brouwer's fan theorem. The work is a contribution to constructive reverse mathematics.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Omniscience, sequential compactness, and the anti-Specker property.Douglas Bridges - 2011 - Logic Journal of the IGPL 19 (1):53-61.
    Working within Bishop-style constructive mathematics, we derive a number of results relating the nonconstructive LPO and sequential compactness property on the one hand, and the intuitionistically reasonable anti-Specker property on the other.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The anti-Specker property, a Heine–Borel property, and uniform continuity.Josef Berger & Douglas Bridges - 2008 - Archive for Mathematical Logic 46 (7-8):583-592.
    Working within Bishop’s constructive framework, we examine the connection between a weak version of the Heine–Borel property, a property antithetical to that in Specker’s theorem in recursive analysis, and the uniform continuity theorem for integer-valued functions. The paper is a contribution to the ongoing programme of constructive reverse mathematics.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Varieties of constructive mathematics.D. S. Bridges - 1987 - New York: Cambridge University Press. Edited by Fred Richman.
    This is an introduction to, and survey of, the constructive approaches to pure mathematics. The authors emphasise the viewpoint of Errett Bishop's school, but intuitionism. Russian constructivism and recursive analysis are also treated, with comparisons between the various approaches included where appropriate. Constructive mathematics is now enjoying a revival, with interest from not only logicans but also category theorists, recursive function theorists and theoretical computer scientists. This account for non-specialists in these and other disciplines.
    Direct download  
     
    Export citation  
     
    Bookmark   48 citations  
  • Subsystems of Second Order Arithmetic.Stephen George Simpson - 1999 - Springer Verlag.
    Stephen George Simpson. with definition 1.2.3 and the discussion following it. For example, taking 90(n) to be the formula n §E Y, we have an instance of comprehension, VYEIXVn(n€X<—>n¢Y), asserting that for any given set Y there exists a ...
    Direct download  
     
    Export citation  
     
    Bookmark   131 citations  
  • Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
     
    Export citation  
     
    Bookmark   230 citations