Switch to: References

Add citations

You must login to add citations.
  1. The Computational Power of ℳω.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.
    We prove that the Kleene schemes for primitive recursion relative to the μ-operator, relativized to some nondeterministic objects, have the same power to express total functionals when interpreted over the partial continuous functionals and over the Kleene-Kreisel continuous functionals. Relating the former interpretation to Niggl's ℳω we prove Nigg's conjecture that ℳω is strictly weaker than Plotkin's PCF + PA.
    Download  
     
    Export citation  
     
    Bookmark  
  • Limit spaces and transfinite types.Dag Normann & Geir Waagb - 2002 - Archive for Mathematical Logic 41 (6):525-539.
    We give a characterisation of an extension of the Kleene-Kreisel continuous functionals to objects of transfinite types using limit spaces of transfinite types.
    Download  
     
    Export citation  
     
    Bookmark  
  • On church's formal theory of functions and functionals.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A categorical approach to the theory of computation.Philip S. Mulry - 1989 - Annals of Pure and Applied Logic 43 (3):293-305.
    Download  
     
    Export citation  
     
    Bookmark  
  • On church's formal theory of functions and functionals: The λ-calculus: connections to higher type recursion theory, proof theory, category theory.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.
    Download  
     
    Export citation  
     
    Bookmark