A note on universal sets

Journal of Symbolic Logic 31 (4):573-574 (1966)
  Copy   BIBTEX

Abstract

In this note is proved the following:Theorem.Iƒ A × B is universal and one oƒ A, B is r.e. then one of A, B is universal.Letα, τbe 1-argument recursive functions such thatxgoes to, τ) is a map of the natural numbers onto all ordered pairs of natural numbers. A set A of natural numbers is calleduniversalif every r.e. set is reducible to A; A × B is calleduniversalif the set.

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
Axiomatizing universal properties of quantifiers.Kees Doets - 1991 - Journal of Symbolic Logic 56 (3):901-905.
Quantifier elimination for neocompact sets.H. Jerome Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.
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.

Analytics

Added to PP
2009-01-28

Downloads
25 (#620,961)

6 months
5 (#633,186)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bounded Immunity and Btt‐Reductions.Stephen Fenner & Marcus Schaefer - 1999 - Mathematical Logic Quarterly 45 (1):3-21.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
Classes bounded by incomplete sets.Kejia Ho & Frank Stephan - 2002 - Annals of Pure and Applied Logic 116 (1-3):273-295.

Add more citations

References found in this work

Theory of Formal Systems.Raymond M. Smullyan - 1965 - Journal of Symbolic Logic 30 (1):88-90.

Add more references