Partial numberings and precompleteness

In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 325-340 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1515/9781614518044.325

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

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

Through your library

My notes

Similar books and articles

A note on partial numberings.Serikzhan Badaev & Dieter Spreen - 2005 - Mathematical Logic Quarterly 51 (2):129-136.
Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.
An isomorphism theorem for partial numberings.Dieter Spreen - 2014 - In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 341-382.
Stability of representations of effective partial algebras.Jens Blanck, Viggo Stoltenberg-Hansen & John V. Tucker - 2011 - Mathematical Logic Quarterly 57 (2):217-231.
Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
Review: Hartley Rogers, Godel Numberings of Partial Recursive Functions. [REVIEW]Martin Davis - 1964 - Journal of Symbolic Logic 29 (3):146-146.
The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions.Gregory A. Riccardi - 1982 - Mathematical Logic Quarterly 28 (20‐21):285-296.
Effectively closed sets and enumerations.Paul Brodhead & Douglas Cenzer - 2008 - Archive for Mathematical Logic 46 (7-8):565-582.
Acceptable Numerations of Morphisms and Myhill‐Shepherdson Property.Akira Kanda - 1995 - Mathematical Logic Quarterly 41 (1):39-48.
Some applications of computable one-one numberings.Martin Kummer - 1990 - Archive for Mathematical Logic 30 (4):219-230.
Topological aspects of numberings.Wolfram Menzel & Frank Stephan - 2003 - Mathematical Logic Quarterly 49 (2):129-149.
Partial reinforcement effect, reverse partial reinforcement effect, and generalized partial reinforcement effect within subjects.Roger L. Mellgren & Dennis G. Dyck - 1972 - Journal of Experimental Psychology 92 (3):339.
Some independence results for control structures in complete numberings.Sanjay Jain & Jochen Nessel - 2001 - Journal of Symbolic Logic 66 (1):357-382.

Analytics

Added to PP
2015-04-02

Downloads
14 (#985,107)

6 months
1 (#1,461,875)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references