Binary subtrees with few labeled paths
暂无分享,去创建一个
[1] Takis Konstantopoulos,et al. School of Mathematical and Computer Sciences , 2006 .
[2] Joseph R. Mileti. The canonical Ramsey theorem and computability theory , 2008 .
[3] Antonio Montalbán,et al. On the Equimorphism Types of Linear Orderings , 2007, Bulletin of Symbolic Logic.
[4] Stephen G. Simpson. Mass problems and randomness , 2005, Bull. Symb. Log..
[5] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[6] Anil Nerode,et al. Introduction to the handbook of Recursive Mathematics , 1998 .
[7] Andrew Odlyzko,et al. Functional iteration and the Josephus problem , 1991, Glasgow Mathematical Journal.
[8] Robert Goldblatt. The McKinsey Axiom Is Not Canonical , 1991, J. Symb. Log..
[9] Carl G. Jockusch,et al. Degrees of Functions with no Fixed Points , 1989 .
[10] Rodney G. Downey,et al. Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.
[11] Zoltán Füredi,et al. Difference sets and inverting the difference operator , 1996, Comb..
[12] Henry A. Kierstead,et al. An effective version of Dilworth’s theorem , 1981 .
[13] G. Pólya,et al. Problems and theorems in analysis , 1983 .
[14] Sebastiaan Terwijn,et al. The Medvedev lattice of computably closed sets , 2006, Arch. Math. Log..
[15] Noam Greenberg,et al. DIAGONALLY NON-RECURSIVE FUNCTIONS AND EFFECTIVE HAUSDORFF DIMENSION , 2011 .
[16] André Nies,et al. Calibrating Randomness , 2006, Bull. Symb. Log..
[17] A. Kucera. Measure, Π10-classes and complete extensions of PA , 1985 .
[18] Jeffrey B. Remmel,et al. Chapter 13 Π10 classes in mathematics , 1998 .