5 results
Bounding non-GL2 and R.E.A.
-
- Journal:
- The Journal of Symbolic Logic / Volume 74 / Issue 3 / September 2009
- Published online by Cambridge University Press:
- 12 March 2014, pp. 989-1000
- Print publication:
- September 2009
-
- Article
- Export citation
Absolutely non-computable predicates and functions in analysis†
-
- Journal:
- Mathematical Structures in Computer Science / Volume 19 / Issue 1 / February 2009
- Published online by Cambridge University Press:
- 01 February 2009, pp. 59-71
-
- Article
- Export citation
Conference on Computability, Complexity and Randomness
-
- Journal:
- Bulletin of Symbolic Logic / Volume 14 / Issue 4 / December 2008
- Published online by Cambridge University Press:
- 15 January 2014, pp. 548-549
- Print publication:
- December 2008
-
- Article
- Export citation
There is no SW-complete c.e. real
-
- Journal:
- The Journal of Symbolic Logic / Volume 69 / Issue 4 / December 2004
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1163-1170
- Print publication:
- December 2004
-
- Article
- Export citation
Eighth Asian Logic Conference
-
- Journal:
- Bulletin of Symbolic Logic / Volume 9 / Issue 2 / June 2003
- Published online by Cambridge University Press:
- 15 January 2014, p. 256
- Print publication:
- June 2003
-
- Article
- Export citation