On Sparse Complete Sets

Mathematical Logic Quarterly 31 (14-18):281-287 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 107,053

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 Sparse Complete Sets.Gerd Wechsung - 1985 - Mathematical Logic Quarterly 31 (14-18):281-287.
Constructively Complete Finite Sets.Mark Mandelkern - 1988 - Mathematical Logic Quarterly 34 (2):97-103.
Universal and complete sets in martingale theory.Dominique Lecomte & Miroslav Zelený - 2018 - Mathematical Logic Quarterly 64 (4-5):312-335.
On existence of complete sets for bounded reducibilities.Valeriy Bulitko & Vadim Bulitko - 2003 - Mathematical Logic Quarterly 49 (6):567-575.
On Some Complexity Characteristics of Immune Sets.Valeriy K. Bulitko - 1995 - Mathematical Logic Quarterly 41 (3):307-313.
Omitting types in logic of metric structures.Ilijas Farah & Menachem Magidor - 2018 - Journal of Mathematical Logic 18 (2):1850006.

Analytics

Added to PP
2013-10-31

Downloads
40 (#655,806)

6 months
2 (#1,454,979)

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

Computational Complexity.K. Wagner & G. Wechsung - 1989 - Journal of Symbolic Logic 54 (2):622-624.

Add more references