Theorie der Numerierungen I

Mathematical Logic Quarterly 19 (19‐25):289-388 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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-11-24

Downloads
23 (#644,212)

6 months
7 (#350,235)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Classifying positive equivalence relations.Claudio Bernardi & Andrea Sorbi - 1983 - Journal of Symbolic Logic 48 (3):529-538.
Total sets and objects in domain theory.Ulrich Berger - 1993 - Annals of Pure and Applied Logic 60 (2):91-117.
Fixed point theorems for precomplete numberings.Henk Barendregt & Sebastiaan A. Terwijn - 2019 - Annals of Pure and Applied Logic 170 (10):1151-1161.
The theory of ceers computes true arithmetic.Uri Andrews, Noah Schweber & Andrea Sorbi - 2020 - Annals of Pure and Applied Logic 171 (8):102811.
A small complete category.J. M. E. Hyland - 1988 - Annals of Pure and Applied Logic 40 (2):135-165.

View all 31 citations / Add more citations

References found in this work

Creative sets.John Myhill - 1955 - Mathematical Logic Quarterly 1 (2):97-108.
Gödel numberings of partial recursive functions.Hartley Rogers - 1958 - Journal of Symbolic Logic 23 (3):331-341.
Standard Classes of Recursively Enumerable Sets.A. H. Lachlan - 1964 - Mathematical Logic Quarterly 10 (2-3):23-42.

View all 7 references / Add more references