The Computational Power of ℳ

Mathematical Logic Quarterly 48 (1):117-124 (2002)
  Copy   BIBTEX

Abstract

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

Other Versions

original Rordam, C.; Normann, D. (2002) "The Computational Power of M^o^m^e^g^a". Mathematical Logic Quarterly 48(1):117-124

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,445

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-12-01

Downloads
12 (#1,298,903)

6 months
2 (#1,695,113)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dag Normann
University of Oslo

Citations of this work

No citations found.

Add more citations

References found in this work

Mω considered as a programming language.Karl-Heinz Niggl - 1999 - Annals of Pure and Applied Logic 99 (1-3):73-92.

Add more references