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)

Categories

Keywords

Reprint years

1996

DOI

10.2307/2270678

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,991

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

Marian Boykan Pour-El. Independent axiomatization and its relation to the hypersimple set. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 14 , pp. 449–456. [REVIEW]Lawrence Feiner - 1973 - Journal of Symbolic Logic 38 (4):654-655.
Marian Boykan Pour-El and Ian Richards. A computable ordinary differential equation which possesses no computable solution, Annals of mathematical logic, vol. 17 , pp. 61–90. - Marian Boykan Pour-El and Ian Richards. The wave equation with computable initial data such that its unique solution is not computable. Advances in mathematics, vol. 39 , pp. 215–239. [REVIEW]G. Kreisel - 1982 - Journal of Symbolic Logic 47 (4):900-902.
Review: Marian Boykan Pour-El, Ian Richards, A Computable Ordinary Differential Equation with Possesses no Computable Solution; Marian Boykan Pour-El, Ian Richards, The Wave Equation with Computable Initial Data Such that its Unique Solution is not Computable. [REVIEW]G. Kreisel - 1982 - Journal of Symbolic Logic 47 (4):900-902.
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 , pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 99–100. [REVIEW]James C. Owings - 1973 - Journal of Symbolic Logic 38 (1):155-156.
A Theorem on Hypersimple Sets.J. C. E. Dekker - 1956 - Journal of Symbolic Logic 21 (1):100-100.
Hilary Putnam. A note on constructible sets of integers. Notre Dame journal of formal logic, vol. 4 no. 4 , pp. 270–273. [REVIEW]Richard Mansfield - 1971 - Journal of Symbolic Logic 36 (2):339-340.
Review: Donald A. Martin, A Theorem on Hyperhypersimple Sets. [REVIEW]Marian Boykan Pour-El - 1966 - Journal of Symbolic Logic 31 (1):139-139.
Donald A. Martin. Borel determinacy. Annals of mathematics, ser. 2 vol. 102 , pp. 363–371. - Donald A. Martin. Infinite games. Proceedings of the International Congress of Mathematicians, Helsinki 1978, vol. 1, edited by Olli Lehto, Academia Scientarium Fennica, Helsinki1980, pp. 269–273. [REVIEW]A. Louveau - 1984 - Journal of Symbolic Logic 49 (4):1425.
Abner Shimony. Coherence and the axioms of confirmation. The journal of symbolic logic, vol. 20 , pp. 1–28. - R. Sherman Lehman. On confirmation and rational betting. The journal of symbolic logic, vol. 20 , pp. 251–262. - John G. Kemeny. Fair bets and inductive probabilities. The journal of symbolic logic, vol. 20 , pp. 263–273. [REVIEW]Frederic Schick - 1968 - Journal of Symbolic Logic 33 (3):481-482.
Review: J. C. E. Dekker, A Theorem on Hypersimple Sets. [REVIEW]Norman Shapiro - 1956 - Journal of Symbolic Logic 21 (1):100-100.

Analytics

Added to PP
2014-04-01

Downloads
27 (#608,353)

6 months
2 (#1,258,417)

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