Donald A. Martin. A theorem on hyper hypersimple sets. The journal of symbolic logic, vol. 28 no. 4 , pp. 273–278

Journal of Symbolic Logic 31 (1):139-139 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

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

A Theorem on Hypersimple Sets.J. C. E. Dekker - 1956 - Journal of Symbolic Logic 21 (1):100-100.
A Theorem on Hyperhypersimple Sets.Donald A. Martin - 1966 - Journal of Symbolic Logic 31 (1):139-139.
A theorem on hyperhypersimple sets.Donald A. Martin - 1963 - Journal of Symbolic Logic 28 (4):273-278.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
Some New Lattice Constructions in High R. E. Degrees.Heinrich Rolletschek - 1995 - Mathematical Logic Quarterly 41 (3):395-430.
A Machine Program for Theorem-Proving.Martin Davis, George Logemann & Donald Loveland - 1967 - Journal of Symbolic Logic 32 (1):118-118.
Covering analytic sets by families of closed sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.

Analytics

Added to PP
2014-04-01

Downloads
26 (#524,350)

6 months
3 (#445,838)

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