Recursively invariant beta-recursion theory

Annals of Mathematical Logic 21 (1):27 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(81)90015-2

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

My notes

Similar books and articles

Myhill's work in recursion theory.J. C. E. Dekker & E. Ellentuck - 1992 - Annals of Pure and Applied Logic 56 (1-3):43-71.
Contributions to [alpha]- and [beta]-recursion theory.Wolfgang Maass - 1978 - München: Minerva-Publikation.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Major subsets and automorphisms of recursively enumerable sets.Wolfgang Maass - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 21.
Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts.Henryk Kotlarski & Bozena Piekart - 1995 - Mathematical Logic Quarterly 41 (1):138-142.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Ordinal machines and admissible recursion theory.Peter Koepke & Benjamin Seyfferth - 2009 - Annals of Pure and Applied Logic 160 (3):310-318.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
The equivalence of bar recursion and open recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.
On alpha- and beta-recursively enumerable degrees.Wolfgang Maass - 1979 - Annals of Mathematical Logic 16 (3):205.
The Embedding Problem for the Recursively Enumerable Degrees.Shoenfield'S. Conjecture - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--13.
Major subsets and the lattice of recursively enumerable sets.Michael Stob - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 107.
Embeddings into the recursively enumerable degreesi.Nsf Grant Dms92 - 1996 - In S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.), Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press. pp. 185.

Analytics

Added to PP
2014-01-17

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

The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Constructibility.Keith J. Devlin - 1987 - Journal of Symbolic Logic 52 (3):864-867.
The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.

View all 19 references / Add more references