The Axiomatization of Randomness
暂无分享,去创建一个
[1] R. Mises. Grundlagen der Wahrscheinlichkeitsrechnung , 1919 .
[2] J. C. Oxtoby. Measure and Category , 1971 .
[3] R. Solovay. A model of set-theory in which every set of reals is Lebesgue measurable* , 1970 .
[4] John L. Bell,et al. Boolean-valued models and independence proofs in set theory , 1977 .
[5] A. Nerode,et al. Recursion Theory on Fields and Abstract Dependence , 1980 .
[6] J. Krivine,et al. Forcing and generalized quantifiers , 1973 .
[7] Gregory. J. Chaitin,et al. Algorithmic information theory , 1987, Cambridge tracts in theoretical computer science.
[8] A. Troelstra. Constructivism in mathematics , 1988 .
[9] Kit Fine,et al. Natural deduction and arbitrary objects , 1985, J. Philos. Log..
[10] Gregory J. Chaitin,et al. Algorithmic Information Theory , 1987, IBM J. Res. Dev..
[11] G. Calvé,et al. Systèmes aléatoires généralisés à liaisons complètes , 1971 .
[12] A. Church. On the concept of a random sequence , 1940 .
[13] T. Parthasarathy. Selection Theorems and Their Applications , 1972 .
[14] A. Kolmogorov,et al. ALGORITHMS AND RANDOMNESS , 1988 .
[15] Charles Steinhorn. Borel Structures for First-order and Extended Logics , 1985 .
[16] P. Martin-Löf. Complexity oscillations in infinite binary sequences , 1971 .
[17] Per Martin-Löf,et al. The Definition of Random Sequences , 1966, Inf. Control..