Liang," Lowness and Π20 nullsets"

, &
Journal of Symbolic Logic 71:3 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

  • This entry has no external links. Add one.
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

Reviewed Work(s): Lowness properties and randomness. Advances in Mathematics, vol. 197 by André Nies; Lowness for the class of Schnorr random reals. SIAM Journal on Computing, vol. 35 by Bjørn Kjos-Hanssen; André Nies; Frank Stephan; Lowness for Kurtz randomness. The Journal of Symbolic Logic, vol. 74 by Noam Greenberg; Joseph S. Miller; Randomness and lowness notions via open covers. Annals of Pure and Applied Logic, vol. 163 by Laurent Bienvenu; Joseph S. Miller; Relativizations of randomness and genericity notions. The Bulletin of the London Mathematical Society, vol. 43 by Johanna N. Y. Franklin; Frank Stephan; Liang Yu; Randomness notions and partial relativization. Israel Journal of Mathematics, vol. 191 by George Barmpalias; Joseph S. Miller; André Nies. [REVIEW]Johanna N. Y. Franklin - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
André Nies. Lowness properties and randomness. Advances in Mathematics, vol. 197 , no. 1, pp. 274–305. - Bjørn Kjos-Hanssen, André Nies, and Frank Stephan. Lowness for the class of Schnorr random reals. SIAM Journal on Computing, vol. 35 , no. 3, pp. 647–657. - Noam Greenberg and Joseph S. Miller. Lowness for Kurtz randomness. The Journal of Symbolic Logic, vol. 74 , no. 2, pp. 665–678. - Laurent Bienvenu and Joseph S. Miller. Randomness and lowness notions via open covers. Annals of Pure and Applied Logic, vol. 163 , no. 5, pp. 506–518. - Johanna N. Y. Franklin, Frank Stephan, and Liang. Yu Relativizations of randomness and genericity notions. The Bulletin of the London Mathematical Society, vol. 43 , no. 4, pp. 721–733. - George Barmpalias, Joseph S. Miller, and André Nies. Randomness notions and partial relativization. Israel Journal of Mathematics, vol. 191 , no. 2, pp. 791–816. [REVIEW]Johanna N. Y. Franklin - 2013 - Bulletin of Symbolic Logic 19 (1):115-118.
Lowness and Π₂⁰ nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044-1052.
Calibrating randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.
Downey, R., f, iiForte, G. and Nies, A., Addendum to.R. Jin, I. Kalantari, L. Welch, B. Khoussainov, R. A. Shore, A. P. Pynko, P. Scowcroft, S. Shelah, J. Zapletal & J. B. Wells - 1999 - Annals of Pure and Applied Logic 98:299.
André Nies. Computability and randomness. Oxford Logic Guides, vol. 51. Oxford University Press, Oxford, 2009, xv + 433 pp. [REVIEW]Anthony Morphett - 2010 - Bulletin of Symbolic Logic 16 (1):85-87.
Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
REVIEWS-A. Nies, Computability and randomness.Anthony Morphett - 2010 - Bulletin of Symbolic Logic 16 (1).
Schnorr trivial sets and truth-table reducibility.Johanna N. Y. Franklin & Frank Stephan - 2010 - Journal of Symbolic Logic 75 (2):501-521.
Promptness Does Not Imply Superlow Cuppability.David Diamondstone - 2009 - Journal of Symbolic Logic 74 (4):1264 - 1272.

Analytics

Added to PP
2014-03-18

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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