Skip to main content
SpringerLink
Log in

Subrecursive hierarchies on Scott domains

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Summary

We study a notion ofpartial primitive recursion (p.p.r.) including the concept ofparallelism in the context of partial continuous functions of type level one in the sense of [Krei], [Sco82], [Ers]. A variety of subrecursive hierarchies with respect top.p.r. is introduced and it turns out that they all coincide.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • [Abr] Abramsky, S.: Semantics of PCF. 1989 (Preprint)

  • [Co] Cook, S.A.: Computability and complexity of higher type functions. MSRI Proceedings (1990)

  • [Ers] Ersov, Y.L.: The model C of partial continuous functionals. In: Gandy, R., Hyland, M. (eds.) Logic colloquium 1976, vol. 87, pp. 455–467. Amsterdam: North-Holland 1977

    Google Scholar 

  • [Gö] Gödel, K.: Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica12, 280–287 (1958)

    Google Scholar 

  • [Grz] Grzegorczyk, A.: Some classes of recursive functions. Rozpr. Mat. IV. Warzawa vol. 4, 46 p. (1953)

  • [Hein] Heinermann, W.: Untersuchungen über die Rekursionszahlen rekursiver Funktionen. Diss. Münster (1961)

  • [Krei] Kreisel, G.: Interpretation of analysis by means of constructive functionals of finite types. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 101–128. Amsterdam: North-Holland 1959

    Google Scholar 

  • [Ni] Niggl, K.H.: Subrekursive Hierarchien auf berechenbaren Funktionen. Diplomarbeit München (1989)

  • [Plot] Plotkin, G.D.: LCF considered as a programming language. Theor. Comput. Sci.5, 223–255 (1977)

    Google Scholar 

  • [Ritch] Ritchie, R.W.: Classes of recursive functions based on Ackermann's functions. Pac. J. Math.15, 1027–1044 (1965)

    Google Scholar 

  • [Schw69] Schwichtenberg, H.: Rekursionszahlen und die Grzegorczyk-Hierarchie. Arch. Math. Logik12, 85–97 (1969)

    Google Scholar 

  • [Schw86] Schwichtenberg, H.: Eine Normalform für endliche Approximationen von partiellen stetigen Funktionalen. In: Diller, J. (ed.) Logik und Grundlagenforschung, Festschrift zum 100. Geburtstag von Heinrich Scholz 89–95. Münster: Aschendorf 1986

    Google Scholar 

  • [Schw91] Schwichtenberg, H.: Primitive recursion on the partial continuous functionals. In: Broy, M. (ed.) Informatik und Mathematik, 251–259. Berlin Heidelberg New York: Springer 1991

    Google Scholar 

  • [Sco69] Scott, D.: A type theoretical alternative to ISWIM, CUCH, OWHY. Manuscript, Oxford: 1969

  • [Sco82] Scott, D.: Domains for denotational semantics. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages and Programming. (Lect. Notes Comput. Sci. vol. 140, 150, pp. 577–613) Berlin Heidelberg New York: Springer 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut der Ludwig-Maximilians-Universität München, Theresienstrasse 39, W-8000, München 2, Germany

    Karl-Heinz Niggl

Authors
  1. Karl-Heinz Niggl
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Niggl, KH. Subrecursive hierarchies on Scott domains. Arch Math Logic 32, 239–257 (1993). https://doi.org/10.1007/BF01387405

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01387405

Keywords

Search

Navigation