Switch to: Citations

Add references

You must login to add references.
  1. Varieties of constructive mathematics.Douglas Bridges & Fred Richman - 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.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • (1 other version)Foundations of Constructive Mathematics.Michael J. Beeson - 1987 - Studia Logica 46 (4):398-399.
    Download  
     
    Export citation  
     
    Bookmark   94 citations  
  • Constructive Analysis.Errett Bishop & Douglas Bridges - 1987 - Journal of Symbolic Logic 52 (4):1047-1048.
    Download  
     
    Export citation  
     
    Bookmark   88 citations  
  • (2 other versions)Foundations of Constructive Analysis.John Myhill - 1972 - Journal of Symbolic Logic 37 (4):744-747.
    Download  
     
    Export citation  
     
    Bookmark   201 citations  
  • Constructive Functional Analysis.D. S. Bridges & Peter Zahn - 1982 - Journal of Symbolic Logic 47 (3):703-705.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Real numbers, continued fractions and complexity classes.Salah Labhalla & Henri Lombardi - 1990 - Annals of Pure and Applied Logic 50 (1):1-28.
    We study some representations of real numbers. We compare these representations, on the one hand from the viewpoint of recursive functionals, and of complexity on the other hand.The impossibility of obtaining some functions as recursive functionals is, in general, easy. This impossibility may often be explicited in terms of complexity: - existence of a sequence of low complexity whose image is not a recursive sequence, - existence of objects of low complexity but whose images have arbitrarily high time- complexity .Moreover, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations