7 results
DEMUTH’S PATH TO RANDOMNESS
-
- Journal:
- Bulletin of Symbolic Logic / Volume 21 / Issue 3 / September 2015
- Published online by Cambridge University Press:
- 15 September 2015, pp. 270-305
- Print publication:
- September 2015
-
- Article
- Export citation
COMPUTING K-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
-
- Journal:
- Bulletin of Symbolic Logic / Volume 20 / Issue 1 / March 2014
- Published online by Cambridge University Press:
- 13 May 2014, pp. 80-90
- Print publication:
- March 2014
-
- Article
- Export citation
5 - Turn-Based Stochastic Games
-
-
- Book:
- Lectures in Game Theory for Computer Scientists
- Published online:
- 01 June 2011
- Print publication:
- 06 January 2011, pp 146-184
-
- Chapter
- Export citation
Low upper bounds of ideals
-
- Journal:
- The Journal of Symbolic Logic / Volume 74 / Issue 2 / June 2009
- Published online by Cambridge University Press:
- 12 March 2014, pp. 517-534
- Print publication:
- June 2009
-
- Article
- Export citation
Equivalence-checking on infinite-state systems: Techniques and results
-
- Journal:
- Theory and Practice of Logic Programming / Volume 6 / Issue 3 / May 2006
- Published online by Cambridge University Press:
- 11 May 2006, pp. 227-264
-
- Article
- Export citation
Lowness for the class of random sets
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1396-1402
- Print publication:
- December 1999
-
- Article
- Export citation
On recursion theory in IΣ1
-
- Journal:
- The Journal of Symbolic Logic / Volume 54 / Issue 2 / June 1989
- Published online by Cambridge University Press:
- 12 March 2014, pp. 576-589
- Print publication:
- June 1989
-
- Article
- Export citation