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