On p-reducibility of numerations

Annals of Pure and Applied Logic 63 (1):57-60 (1993)
  Copy   BIBTEX

Abstract

Degtev, A.N., On p-reducibility of numerations, Annals of Pure and Applied Logic 63 57–60. If α and β are two numerations of a set S, then αpβ if there exists a total recursive function f such that [s ε S][α-1=[x:[y ε Df][Dyβ-1]]], where Dn is a finite set with canonical number n. It is proved that if α and β are two computable numerations of some family of recursively enumerable sets A and αpβ, then there is a computable numeration, γ, of S such that αpγ and β

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(93)90208-u

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

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

Generalizations of enumeration reducibility using recursive infinitary propositional sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.
The inclusion-exclusion principle for finitely many isolated sets.J. C. E. Dekker - 1986 - Journal of Symbolic Logic 51 (2):435-447.
On recursively enumerable structures.Victor Selivanov - 1996 - Annals of Pure and Applied Logic 78 (1-3):243-258.
Retracts of numerations.Akira Kanda - 1989 - Annals of Pure and Applied Logic 42 (3):225-242.
Covering a function on the plane by two continuous functions on an uncountable square – the consistency.Mariusz Rabus & Saharon Shelah - 2000 - Annals of Pure and Applied Logic 103 (1-3):229-240.
On the computability of fractal dimensions and Hausdorff measure.Ker-I. Ko - 1998 - Annals of Pure and Applied Logic 93 (1-3):195-216.
Maximal pairs of c.e. reals in the computably Lipschitz degrees.Yun Fan & Liang Yu - 2011 - Annals of Pure and Applied Logic 162 (5):357-366.
On the ranked points of a Π1 0 set.Douglas Cenzer & Rick L. Smith - 1989 - Journal of Symbolic Logic 54 (3):975-991.
In the random graph G(n, p), p = n−a: If ψ has probability O(n−ε) for every ε > 0 then it has probability O(e−nε) for some ε > 0.Saharon Shelah - 1996 - Annals of Pure and Applied Logic 82 (1):97-102.
Characterization of recursively enumerable sets.Jesse B. Wright - 1972 - Journal of Symbolic Logic 37 (3):507-511.

Analytics

Added to PP
2014-01-16

Downloads
11 (#1,147,580)

6 months
11 (#340,261)

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