Arithmetical Sacks Forcing

by Rod Downey , Liang Yu
Venue:Archive for Mathematical Logic
Citations:3 - 0 self

Documents Related by Co-Citation

19 Learning via queries to an oracle – William Gasarch, Mark Pleszkoch - 1989
16 Learning with the knowledge of an upper bound on program size – Sanjay Jain, Arun Sharma - 1993
15 On the non-existence of maximal inference degrees for language identification – Sanjay Jain, Arun Sharma - 1993
20 Inductive inference with additional information. Elektronische Informationsverarbeitung und Kybernetik 15:179–185 – Rūsiņˇs Freivalds, Rolf Wiehagen - 1979
4 Prognostication of automata and functions – Janis Bārzdiņˇs - 1971
5 Three theorems on tt-degrees – Alexander Dëgtev - 1978
7 Reducibilities in Recursive Function Theories – Carl G Jockusch - 1966
5 Reducibility by linear Zhegalkin tables – Valeriy K Bulitko - 1980
5 English translation – tt-, m-degrees Algebra, Russian Logic - 1973
6 Comparison of linear reducibility with other reducibilities of tabular type – Alexander Dëgtev - 1982
4 On (m,n)-computable sets. Algebraic Systems (Edited by D.I – Alexander Dëgtev - 1981
6 Calude and André Nies, Chaitin Ω numbers and strong reducibilities – S Cristian - 1997
3 Gaps in Bounded Query Hierarchies – Richard Beigel
3 The Rise and Fall of the Church-Turing Thesis – Mark Burgin - 1999
3 Algorithmi Information Theory. Cambridge Tracts – Gregory Chaitin - 1987
3 Two notes on r.e. sets – James C E Dekker - 1953
2 On completeness of pseudosimple sets – Vadim Bulitko - 1995
23 Degrees of functions with no fixed points – Carl G Jockusch - 1989
74 A machine independent theory of the complexity of recursive functions – M Blum - 1967