Switch to: Citations

Add references

You must login to add references.
  1. The |lambda-Calculus.H. P. Barendregt - 1981 - Philosophical Review 97 (1):132-137.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Relativized realizability in intuitionistic arithmetic of all finite types.Nicolas D. Goodman - 1978 - Journal of Symbolic Logic 43 (1):23-44.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Constructivism in Mathematics: An Introduction.A. S. Troelstra & Dirk Van Dalen - 1988 - Amsterdam: North Holland. Edited by D. van Dalen.
    The present volume is intended as an all-round introduction to constructivism. Here constructivism is to be understood in the wide sense, and covers in particular Brouwer's intuitionism, Bishop's constructivism and A.A. Markov's constructive recursive mathematics. The ending "-ism" has ideological overtones: "constructive mathematics is the (only) right mathematics"; we hasten, however, to declare that we do not subscribe to this ideology, and that we do not intend to present our material on such a basis.
    Download  
     
    Export citation  
     
    Bookmark   159 citations  
  • (1 other version)Foundations of Constructive Mathematics.Michael J. Beeson - 1987 - Studia Logica 46 (4):398-399.
    Download  
     
    Export citation  
     
    Bookmark   94 citations  
  • Metamathematical investigation of intuitionistic arithmetic and analysis.Anne S. Troelstra - 1973 - New York,: Springer.
    Download  
     
    Export citation  
     
    Bookmark   85 citations  
  • Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
    Volume II of Classical Recursion Theory describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from small (...)
    Download  
     
    Export citation  
     
    Bookmark   72 citations