On Mathias generic sets

, &
In S. Barry Cooper (ed.), How the World Computes. pp. 129--138 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

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

Generics for computable Mathias forcing.Peter A. Cholak, Damir D. Dzhafarov, Jeffry L. Hirst & Theodore A. Slaman - 2014 - Annals of Pure and Applied Logic 165 (9):1418-1428.
A hierarchy of immunity and density for sets of reals.Takayuki Kihara - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 384--394.
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.
Effective strong nullness and effectively closed sets.Kojiro Higuchi & Takayuki Kihara - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 303--312.
Every 1-Generic Computes a Properly 1-Generic.Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (4):1385 - 1393.
GASARCH, W., see FORTNOW, L. HASKELL, D. and MACPHERSON, D., Cell decompositions of C-minimal structures HIRST, JL, Reverse mathematics and ordinal exponentiation JAIN, S., see FORTNOW, L. [REVIEW]F. Cardone & M. Dezani-Ciancaglini - 1994 - Annals of Pure and Applied Logic 66:303.
Soare Robert I.. Automorphisms of the lattice of recursively enumerable sets. Part I: maximal sets. Annals of mathematics, ser. 2 vol. 100 , pp. 80–120. - Lerman Manuel and Soare Robert I.. d-Simple sets, small sets, and degree classes. Pacific journal of mathematics, vol. 87 , pp. 135–155. - Cholak Peter. Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society, no. 541. American Mathematical Society, Providence1995, viii + 151 pp. - Harrington Leo and Soare Robert I.. The Δ30-automorphism method and noninvariant classes of degrees. Journal of the American Mathematical Society, vol. 9 , pp. 617–666. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Review: Robert Vaught, A. R. D. Mathias, H. Rogers, Descriptive Set Theory in $L{omega1omega}$; Robert Vaught, Invariant Sets in Topology and Logic. [REVIEW]John P. Burgess - 1982 - Journal of Symbolic Logic 47 (1):217-218.
[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
omnibus Review. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.

Analytics

Added to PP
2014-01-28

Downloads
16 (#227,957)

6 months
8 (#1,326,708)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
Double Jumps of Minimal Degrees.Carl G. Jockusch & David B. Posner - 1978 - Journal of Symbolic Logic 43 (4):715 - 724.
Lowness for genericity.Liang Yu - 2006 - Archive for Mathematical Logic 45 (2):233-238.

View all 9 references / Add more references