An isomorphism theorem for partial numberings

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

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

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

Through your library

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.
Some applications of computable one-one numberings.Martin Kummer - 1990 - Archive for Mathematical Logic 30 (4):219-230.
Partial numberings and precompleteness.Dieter Spreen - 2014 - In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 325-340.
A Model Theoretical Generalization of Steinitz’s Theorem.Alexandre Martins Rodrigues & Edelcio De Souza - 2011 - Principia: An International Journal of Epistemology 15 (1):107-110.
Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.
Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
A theorem on the isomorphism property.Renling Jin - 1992 - Journal of Symbolic Logic 57 (3):1011-1017.

Analytics

Added to PP
2015-04-02

Downloads
6 (#1,389,828)

6 months
2 (#1,157,335)

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