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

Links

PhilArchive



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

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

A decomposition of the Rogers semilattice of a family of d.c.e. sets.Serikzhan A. Badaev & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (2):618-640.
On coding uncountable sets by reals.Joan Bagaria & Vladimir Kanovei - 2010 - Mathematical Logic Quarterly 56 (4):409-424.
A special class of almost disjoint families.Thomas E. Leathrum - 1995 - Journal of Symbolic Logic 60 (3):879-891.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
Boolean relation theory.Harvey M. Friedman - unknown
A spatial coding analysis of the a-not-b error: What IS “location at a”?Nora S. Newcombe - 2001 - Behavioral and Brain Sciences 24 (1):57-58.
Coding lemmata in L.George Kafkoulis - 2004 - Archive for Mathematical Logic 43 (2):193-213.
The non‐coding skin: Exploring the roles of long non‐coding RNAs in epidermal homeostasis and disease.Sonja Hombach & Markus Kretz - 2013 - Bioessays 35 (12):1093-1100.
Prime models of finite computable dimension.Pavel Semukhin - 2009 - Journal of Symbolic Logic 74 (1):336-348.
Turing computable embeddings and coding families of sets.Víctor A. Ocasio-González - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 539--548.
Monotone reducibility and the family of infinite sets.Douglas Cenzer - 1984 - Journal of Symbolic Logic 49 (3):774-782.
Extending Baire property by uncountably many sets.Paweł Kawa & Janusz Pawlikowski - 2010 - Journal of Symbolic Logic 75 (3):896-904.
On the existence of inequivalent quasideterministic domains.Irene Giardina & Alberto Rimini - 1996 - Foundations of Physics 26 (8):973-987.
On coding uncountable sets by reals.Joan Bagaria I. Pigrau & Vladimir Kanovei - 2010 - Mathematical Logic Quarterly 56 (4):409-424.

Analytics

Added to PP
2014-01-16

Downloads
11 (#1,136,567)

6 months
4 (#787,709)

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.
Intrinsically< i> gs_;< sup> 0< sub> alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.

View all 14 references / Add more references