Coding a family of sets

Annals of Pure and Applied Logic 94 (1-3):127-142 (1998)
  Copy   BIBTEX

Abstract

In this paper, we state a metatheorem for constructions involving coding. Using the metatheorem, we obtain results on coding a family of sets into a family of relations, or into a single relation. For a concrete example, we show that the set of limit points in a recursive ordering of type ω 2 can have arbitrary 2-REA degree

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(97)00070-5

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

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

Projective mad families.Sy-David Friedman & Lyubomyr Zdomskyy - 2010 - Annals of Pure and Applied Logic 161 (12):1581-1587.
Completions of PA: Models and Enumerations of Representable Sets.Alex M. McAllister - 1998 - Journal of Symbolic Logic 63 (3):1063-1082.
Generalizations of enumeration reducibility using recursive infinitary propositional sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.
Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
Patterns of resemblance of order 2.Timothy J. Carlson - 2009 - Annals of Pure and Applied Logic 158 (1-2):90-124.
Automata techniques for query inference machines.William Gasarch & Geoffrey R. Hird - 2002 - Annals of Pure and Applied Logic 117 (1-3):169-201.
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
On p-reducibility of numerations.A. N. Degtev - 1993 - Annals of Pure and Applied Logic 63 (1):57-60.
Randomness, relativization and Turing degrees.André Nies, Frank Stephan & Sebastiaan A. Terwijn - 2005 - Journal of Symbolic Logic 70 (2):515-535.
$pi^1_1$ Sets, $omega$-Sets, and Metacompleteness.James C. Owings - 1969 - Journal of Symbolic Logic 34 (2):194-204.

Analytics

Added to PP
2014-01-16

Downloads
29 (#812,446)

6 months
14 (#181,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
Intrinsically gs;0alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
Labelling systems and R.E. structures.C. J. Ash - 1990 - Annals of Pure and Applied Logic 47 (2):99-119.
Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.

View all 12 references / Add more references