, Then T is defined to be the union of all the trees in T n for some n. For two trees T 1 , T 2 in T , we say that T 2 extends T 1 or also T 1 T 2 if T 2 ? T 1, addition if T 1 ? T 2 we write T 1 T 2 . We illustrate the tree of trees by the following picture: 7.3. NON-UNIVERSALITY IN CONTINUOUS RELATIVIZATION
, [[i]] for some i, j ? N. Also as B ? i Nar i (T n ) and as ? B we have that ? ? Nar(Nar j (T n )) In particular by Fact 7.3.2 we have that ? i (Nar j (T n )) ? and as ? k (T ) ? i (Nar j (T n )) we also have that ? k (T ) ? which is a contradiction Construction claims
, the search for ? is done in priority over e-strategies. If we find no such prefix, then we set ? s = ? s?1 Otherwise let n = ? and do the following: In case o < ? we set ? s = ? s?1 n ?(o + 1)?0 ? . In case o = ?, let ? be the smallest prefix of A s?1 such that [X e,s d ?1] ? U ? e,s . Using Lemma 7.3.2 we find k such that ? ? k (T ? ) cancels noise around A s?1 above Nar(T ? ) = T ??o . Using Construction claim 2 and claim 3, let t be the last stage smaller than s such that ? t n+1 = ??k. Note that we have A, case at stage s ? 1, some value ? s?1 (n) is equal to ? + 1 whereas ? s?2
, Then either k ? i in which case A s cannot not extend stem(T ? ) and (*) is true at stage s, or k = i, in which case, if stem(T ? ) A s , the string stem(T ? ) is comparable with stem Then by Fact 7.3.3 we have that stem(T ? ) A s iff stem(T ? ) ? j (T ?, iff stem(T ? ) A s ? . Therefore, by induction hypothesis, as (*) is true at stage s ? it is true at stage s
, 1) is not in S, therefore we can apply Lemma 7.3.5: For every stage t ? s + 1, we have A t stem(T ?sm?k?sm?k ) But as stem(T ?sm?k?sm?k ) stem(T ? ) we then have for any t ? s + 1 that A t stem
, Probability and measure theory. ELSE- VIER, 1999.
, Sur les fonctions de variables r??elles, Annali di Matematica Pura ed Applicata, vol.3, issue.1, pp.1-123, 1899.
DOI : 10.1007/BF02419243
, On disjoint Borel uniformizations Advances in mathematics, pp.167-174, 1999.
, How powerful are integervalued martingales? Theory of Computing Systems, pp.330-351, 2012.
, A theory of program size formally identical to information theory, Journal of the ACM (JACM), vol.22, issue.3, pp.329-340, 1975.
, Information-theoretic characterizations of recursive infinite strings, Theoretical Computer Science, vol.2, issue.1, pp.45-48, 1976.
, Lowness of higher randomness notions, Israel Journal of Mathematics, vol.45, issue.1, pp.39-60, 2008.
DOI : 10.1007/s11856-008-1019-9
, Randomness in the higher setting
, Set theory and the continuum hypothesis, DoverPublications.com, 1966.
, Mass problems and hyperarithmeticity, Journal of Mathematical Logic, vol.7, issue.02, pp.125-143, 2007.
, Computability theory, 2003.
, Limits to joining with generics and randoms, Proceedings of the 12th Asian Logic Conference, 2012.
DOI : 10.1142/9789814449274_0004
, Cupping with random sets, Proceedings of the American Mathematical Society, vol.142, issue.8, pp.2871-2879, 2014.
DOI : 10.1090/S0002-9939-2014-11997-6
, Computability by Probabilistic Machines, Automata studies, vol.34, pp.183-198, 1955.
DOI : 10.1515/9781400882618-010
, Trivial Reals, Electronic Notes in Theoretical Computer Science, vol.66, issue.1, pp.36-52, 2002.
DOI : 10.1016/S1571-0661(04)80377-3
, Abstract, The Journal of Symbolic Logic, vol.64, issue.03, pp.1044-1052, 2006.
DOI : 10.1016/j.tcs.2004.03.055
, Algorithmic randomness and complexity. Theory and Applications of Computability, 2010.
, There is no degree invariant half-jump, Proceedings of the American Mathematical Society, pp.3033-3037, 1997.
, Some diophantine forms of Gödel's theorem, Archive for Mathematical Logic, vol.22, issue.1, pp.51-60, 1980.
, Some applications of the notions of forcing and generic sets, Fundamenta Mathematicae, vol.56, issue.3, pp.325-345, 1964.
, Incompleteness along paths in progressions of theories, The Journal of Symbolic Logic, vol.14, issue.04, pp.383-390, 1962.
DOI : 10.2307/2371894
, Difference randomness, Proceedings of the American Mathematical Society, vol.139, issue.01, pp.345-360, 2011.
DOI : 10.1090/S0002-9939-2010-10513-0
, Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem, Proceedings of the National Academy of Sciences of the United States of America, p.236, 1944.
, On the symmetry of algorithmic information, Soviet Math. Dokl, vol.15, pp.1477-1480, 1974.
, Every sequence is reducible to a random one, Information and Control, vol.70, issue.2-3, pp.186-192, 1986.
DOI : 10.1016/S0019-9958(86)80004-3
, ¨ Uber formal unentscheidbare sätze der principia mathematica und verwandter systeme i. Monatshefte für mathematik und physik, pp.173-198, 1931.
, The consistency of the axiom of choice and of the generalized continuum-hypothesis with the axioms of set theory. Number 3, 1940.
, Sur la non-contradiction de l'arithmétique, Journal für die reine und angewandte Mathematik, pp.1-8, 1932.
, Using random sets as oracles, Journal of the London Mathematical Society, vol.75, issue.3, pp.610-622, 2007.
DOI : 10.1112/jlms/jdm041
, Randomness via effective descriptive set theory, Journal of the London Mathematical Society, vol.75, issue.2, pp.495-508, 2007.
DOI : 10.1112/jlms/jdm022
, Probability Inequalities for Sums of Bounded Random Variables, Journal of the American Statistical Association, vol.1, issue.301, pp.13-30, 1963.
DOI : 10.1214/aoms/1177730491
, Degrees of random sets, 1991.
, The theory of countable analytical sets. Transactions of the, pp.259-297, 1975.
, Classical descriptive set theory, 1995.
, On the degree spectrum of a ? 0 1 class. Transactions of the, pp.5283-5319, 2010.
, Higher Kurtz randomness, Annals of Pure and Applied Logic, vol.161, issue.10, pp.1280-1290, 2010.
DOI : 10.1016/j.apal.2010.04.001
, On notation for ordinal numbers, The Journal of Symbolic Logic, vol.28, issue.04, pp.150-155, 1938.
DOI : 10.1215/S0012-7094-36-00227-2
, Recursive predicates and quantifiers. Transactions of the, pp.41-73, 1943.
, On the forms of the predicates in the theory of constructive ordinals (second paper) American journal of mathematics, pp.405-428, 1955.
, On tables of random numbers Sankhy¯ a: The Indian Journal of Statistics, Series A, pp.369-376, 1963.
, Three approaches to the quantitative definition of information. Problems of information transmission, pp.1-7, 1965.
, Measure, ?? 1 0 -classes and complete extensions of PA, Recursion theory week, pp.245-259, 1985.
DOI : 10.1016/S0049-237X(08)71117-0
, Randomness and genericity in the degrees of unsolvability, Dissertation Abstracts International Part B: Science and Engineering, vol.42, issue.9, p.1982, 1982.
, Notions of weak genericity. The Journal of symbolic logic, pp.764-770, 1983.
, Randomness and Recursive Enumerability, SIAM Journal on Computing, vol.31, issue.1, pp.199-211, 2001.
DOI : 10.1137/S0097539799357441
, Uniform enumeration operations, The Journal of Symbolic Logic, vol.40, issue.03, pp.401-409, 1975.
, Sur les fonctions représentables analytiquement, Journal de mathematiques pures et appliquees, pp.139-216, 1905.
, Some theorems on the algorithmic approach to probability theory and information theory, Dissertation in mathematics, 1971.
DOI : 10.1016/j.apal.2010.09.007
, The concept of a random sequence, In Dokl. Akad. Nauk SSSR, vol.212, pp.548-550, 1973.
, Laws of information conservation (nongrowth) and aspects of the foundation of probability theory, Problemy Peredachi Informatsii, vol.10, issue.3, pp.30-35, 1974.
, Basic set theory, 1979.
DOI : 10.1007/978-3-662-02308-2
, A weakly 2-random set that is not generalized low. Computation and Logic in the Real World, p.474, 2007.
, An introduction to Kolmogorov complexity and its applications, 2009.
, Sur les ensembles non mesurables B et l'emploi de la diagonale Cantor, CR Acad. Sci. Paris, vol.181, pp.95-96, 1925.
, Zur Theorie der konstruktiven Wohlordnungen, Mathematische Annalen, vol.34, issue.1, pp.135-149, 1954.
DOI : 10.1007/BF01361115
, Borel determinacy, Annals of Mathematics, pp.363-371, 1975.
, The definition of random sequences, Information and Control, vol.9, issue.6, pp.602-619, 1966.
DOI : 10.1016/S0019-9958(66)80018-9
, On the Notion of Randomness, Studies in Logic and the Foundations of Mathematics, pp.73-78, 1970.
DOI : 10.1016/S0049-237X(08)70741-9
, Enumerable sets are diophantine, In Dokl. Akad. Nauk SSSR World Scientific, vol.191, pp.279-282, 1970.
, Abstract., The Journal of Symbolic Logic, vol.212, issue.03, pp.907-913, 2004.
DOI : 10.1007/BF01694181
, On initial segment complexity and degrees of randomness . Transactions of the, pp.3193-3210, 2008.
, Higher randomness and forcing with closed sets, LIPIcs-Leibniz International Proceedings in Informatics Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2014.
, ), Pacific Journal of Mathematics, vol.18, issue.2, pp.329-342, 1966.
DOI : 10.2140/pjm.1966.18.329
, On definable sets of positive integers. Fundamenta mathematicae, pp.81-112, 1947.
, On the unsolvability of the problem of reducibility in the theory of algorithms, In Dokl. Akad. Nauk SSSR, vol.108, p.1, 1956.
, Lowness properties and randomness, Advances in Mathematics, vol.197, issue.1, pp.274-305, 2005.
DOI : 10.1016/j.aim.2004.10.006
, Non-cupping and randomness, Proceedings of the American Mathematical Society, vol.135, issue.03, pp.837-844, 2007.
DOI : 10.1090/S0002-9939-06-08540-6
, Computability and Randomness, 2009.
DOI : 10.1093/acprof:oso/9780199230761.001.0001
, Logic blog 2013. arXiv preprint arXiv:1403, 2014.
, Abstract, The Journal of Symbolic Logic, vol.54, issue.02, pp.515-535, 2005.
DOI : 10.1007/BF01694181
, Classical recursion theory: The theory of functions and sets of natural numbers, 1992.
, Degrees joining to 0 ? . The Journal of Symbolic Logic, pp.714-722, 1981.
, Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol.50, issue.5, pp.284-316, 1944.
, Degrees of unsolvability. Number 55, 1963.
, Measure-theoretic uniformity in recursion theory and set theory. Transactions of the, pp.381-420, 1969.
, Higher recursion theory, 2010.
, Process complexity and effective random tests, Journal of Computer and System Sciences, vol.7, issue.4, pp.376-388, 1973.
, On relations between different algorithmic definitions of randomness, Soviet Mathematics Doklady, vol.38, pp.316-319, 1989.
, On degrees of unsolvability, Annals of mathematics, pp.644-653, 1959.
, Defining the turing jump, Mathematical Research Letters, vol.6, issue.56, pp.711-722, 1999.
, Definable functions on degrees, pp.37-55, 1988.
, A preliminary report on a general theory of inductive inference. Citeseer, 1960.
, A formal theory of inductive inference. part i. Information and control, pp.1-22, 1964.
, Draft of a paper (or series of papers) on Chaitin's work, Unpublished notes, 1975.
, Recursive well-orderings. The Journal of Symbolic Logic, pp.151-163, 1955.
, Forcing with tagged trees, Annals of Mathematical Logic, vol.15, pp.55-74, 1978.
, A classification of jump operators, The Journal of Symbolic Logic, vol.47, issue.02, pp.347-358, 1982.
, Lowness for Weakly 1-generic and Kurtz-Random, Theory and applications of models of computation, pp.756-764, 2006.
DOI : 10.1007/11750321_72
, Sur une définition des ensembles mesurables B sans nombres transfinis, CR Acad. Sci. Paris, vol.164, issue.2, pp.88-91, 1917.
, A basis result for ? 1 1 -sets of positive measure, pp.115-127, 1967.
, Systems of logic based on ordinals, Proceedings of the London Mathematical Society, pp.161-228, 1939.
, Zur Einführung der transfiniten Zahlen Acta Litterarum ac Scientiarum Regiae Universitatis Hungaricae Francisco-Josephinae, sectio scientiarum mathematicarum, pp.199-208, 1923.
, Lowness for genericity Archive for Mathematical Logic, pp.233-238, 2006.
, Descriptive set theoretical complexity of randomness notions, Fundamenta Mathematicae, vol.215, issue.3, pp.219-231, 2011.
DOI : 10.4064/fm215-3-2