Associate Professor Wu Guohua
Publications:
  1. The d.r.e. wtt-degrees are dense (with Shaoyi Wang and Mars. M. Yamaleev), Computability in Europe 2019, Lecture Notes in Computer Science, to appear.
  2. Bounded jump and the high/low hierarchy (with Huishan Wu), 15th Annual Conference, Theory and Applications of Model of Computation (TAMC) 2019, Lecture Notes in Computer Science, volume 11436, 647-658.
  3. Degrees containing members of thin Pi01classes are dense and co-dense (with Rod Downey and Yang Yue), Journal of Mathematical Logic, 18 (2018), DOI: 10.1142/S0219061318500010.
  4. The Kierstead’s Conjecture and limitwise monotonic functions (with Zubkov), Annals of Pure and Applied Logic, 169 (2018), 467-486.
  5. Degrees of Word Problem for Algebras Without Finitely Presented Expansions (with Wu Huishan), Theory and Applications of Models of Computation 2017, Lecture Notes in Computer Science, volume 10185, 643-653.
  6. There are no maximal d.c.e. wtt-degrees (with M. Yamaleev), Downey Festschrift, Lecture Notes in Computer Science, volume 10010, 479-486.
  7. Rudin's Lemma and Reverse Mathematics (with Li Gaolin and Ru Junren), Annals of the Japanese Association for Philosophy of Science 25 (2017), 57-66.
  8. Definable sets in Stone algebras (with Chen and Shi), Archive for Mathematical Logic 55 (2016), 749-757.
  9. Nonexistence of minimal pairs in L[d] (with Fang, Liu and Yamaleev), Computability in Europe 2015, Lecture Notes in Computer Science, volume 9136, 177-185.
  10. Downward Density of Exact Degrees (with J. Liu and M. Yamaleev), Lobachevskii Journal of Mathematics 36 (2015), 389-398.
  11. The members of thin and minimal Pi01 classes, their ranks and Turing degrees (with Downey and Yang), Annals of Pure and Applied Logic 166 (2015), 755-766.
  12. Initial segment complexities of randomness notions (with Holzl, Kraling and Stephan), Information and Computation 234 (2014), 57-67.
  13. Anti-complex sets and reducibilities with tiny use (with Franklin, Greenberg and Stephan), Journal of Symbolic Logic 78 (2013), 1307-1327.
  14. On a problem of Ishmukhametov (with C. L. Fang and M. M. Yamaleev), Archive for Mathematical Logic, 52 (2013), 733-741.
  15. On a question of Csima on computation-time domination (with X. Hua and J. Liu), Proceedings of the 12th Asian Logic Confenence (Editors: Downey, Brendle, Goldblatt and Kim), 178-184, World Scientific, 2013.
  16. Highness, Locally Noncappability and Nonboundings (with Frank Stephan), Annals of Pure and Applied Logic, 164 (2013), 511-522.
  17. Isolation: Motivations and Applications (with M.M. Yamaleev), Proceedings of Kazan University (Physics and Mathematics Series), 52 (2012), 204-217
  18. Highness and local noncappability (with C.L. Fang and S.L. Wang), Computability in Europe 2012, Turing Centenary Conference, Lecture Notes in Computer Science, volume 7318, 203-211.
  19. Nonhemimaximal Degrees and the high/low Hierarchy (with Cheng Ling Fang), Journal of Symbolic Logic 77 (2012), 433-446.
  20. Almost universal cupping and diamond embeddings (with Jiang Liu), Annals of Pure and Applied Logic 163 (2012), 717-729.
  21. An almost-universal cupping degree (with Jiang Liu), Journal of Symbolic Logic 76 (2011), 1137-1152.
  22. Cupping and diamond embeddings: a unifying approach (with C.L. Fang and J. Liu),
    23. Computability in Europe 2011, Lecture Notes in Computer Science, volume 6735, 71-80.
  23. On a hierarchy of pluscupping degrees (with S.L. Wang),
    24. Computability in Europe 2011, Lecture Notes in Computer Science, volume 6735, 310-318.
  24. A superhigh diamond in the c.e. tt-degrees (with D. Cenzer, J. Franklin and J. Liu), Archive for Mathematical Logic 50 (2011), 33-44.
  25. On the complexity of the successivity relation in computable linear orderings (with Rod Downey and Steffen Lempp), Journal of Mathematical Logic 10 (2010), 83-99.
  26. Initial Segment Complexities of Randomness Notions (with Rupert Holzl, Thorsten Kraling, Frank Stephan), Proceedings of the 6th IFIP International Conference on Theoretical Computer Science (IFIP - TCS 2010) AICT 323, 259–270.
  27. Diamond embeddings into the enumeration degrees (with Andrea Sorbi and Yue Yang), Mathematical Structures in Computer Science 20 (2010), 799–811.
  28. Degrees with almost universal cupping property (with Liu Jiang), Computability in Europe 2010: Programs, Proofs, Processes, Lecture Notes in Computer Science, volume 6158, 266-275.
  29. Joining to high degrees via noncuppables (with Liu Jiang), Archive for Mathematical Logic 49 (2010), 195-211.
  30. Infima of d.r.e. degrees (with Liu Jiang and Wang Shenling), Archive for Mathematical Logic 49 (2010), 35-49.
  31. Isolation in the d.c.e. degrees, Proceedings of the 10th Asian Logic Confenence (Eds: Arai, Brendle, Chong, Downey, Feng, Kikyo and Ono), 353-374, World Scientific, 2010.
  32. High minimal pairs in the enumeration degrees (with A. Sorbi and Y. Yang), 6th Annual Conference, Theory and Applications of Model of Computation (TAMC) 2009, Lecture Notes in Computer Science, volume 5532, 335-344.
  33. Cupping Delta02 enumeration degrees to 0' (with M. Soskova), Mathematical Structures in Computer Science 19 (2009), 169-191.
    34. An extended abstract of this paper was published in Computability in Europe 2007, Lecture Notes in Computer Science, volume 4497, 727-738.
  34. Immunity and noncupping for closed sets (with D. Cenzer, T. Kihara and R. Weber), Tbilisi Mathematical Journal 2 (2009), 77-94.
  35. Pseudojump operators and Pi01 classes (with D. Cenzer and G. LaForte), Journal of Logic and Computation 19 (2009), 77-87. A conference version of this paper was also published in Computability in Europe 2007, Lecture Notes in Computer Science, volume 4497, 146-151.
  36. Cupping computably enumerable degrees in the Ershov hierarchy, Proceedings of the workshop Computational Prospects of Infinity (Eds: Chong, Feng, Slaman, Woodin and Yang), part 2, 393-420, World Scientific, 2009.
  37. Joining to high degrees (with Liu Jiang), Computability in Europe 2008, Lecture Notes in Computer Science, volume 5028, 370-378.
  38. The non-isolating degrees are upwards dense in the computably enumerable degrees (with S. Barry Cooper and Matthew C. Salts) Theory and Applications of Models of Computation (TAMC) 2008, Lecture Notes in Computer Science, volume 4978, 588-596. .
  39. Isolation, Infima and Diamond Embeddings (with Jiang Liu), Journal of Logic and Computation 17 (2007), 1153-1166.
  40. A minimal pair in the quotient structure M/NCup (with R. Bie) Computability in Europe 2007, Lecture Notes in Computer Science, volume 4497, 53-62.
  41. Intervals containing exactly one c.e. degree, Annals of Pure and Applied Logic 146 (2007), 91-102.
  42. Randomness and universal machines (with S. Figueira and F. Stephan), Journal of Complexity 22 (2006), 738-751.
  43. Degrees of weakly computable reals (with K. M. Ng and F. Stephan), Computability in Europe 2006, Lecture Notes in Computer Science, volume 3988, 413-422.
  44. A formal fuzzy reasoning system and reasoning mechanism based on propositional modal logic (with Zaiyue Zhang, Yuefei Sui and Cungen Cao), Theoretical Computer Science, 368 (2006), 149-160.
  45. Bounding computably enumerable degrees in the Ershov hierarchy (with Angsheng Li and Yue Yang), Annals of Pure and Applied Logic 141 (2006), 79-88.
  46. Jump operator and Yates degrees, Journal of Symbolic Logic 71 (2006), 252-264.
  47. 1-Generic splittings of computably enumerable degrees, Annals of Pure and Applied Logic 138 (2006), 211-219.
  48. Universal cupping degrees (with Angsheng Li and Yan Song), Theory and Applications of Models of Computation 2006, Lecture Notes in Computer Science, volume 3959, 721-730.
  49. On the quotient structure of computably enumerable degrees modulo the noncuppable ideal (with Angsheng Li and Yue Yang), Theory and Applications of Models of Computation 2006, Lecture Notes in Computer Science, volume 3959, 731-736.
  50. Presentations of K-trivial reals and Kolmogorov complexity (with Frank Stephan), Computability in Europe 2005, Lecture Notes in Computer Science volume 3526, 461-469.
  51. Regular reals, Mathematical Logic Quarterly 51 (2005), 111-119.
  52. On the density of the pseudo-isolated degrees, Proceedings of London Mathematical Society 88 (2004), 273-288.
  53. Bi-isolation in the d.c.e. degrees, Journal of Symbolic Logic 69 (2004), 409-420.
  54. Quasi-complements of the cappable degrees, Mathematical Logic Quarterly 50 (2004), 189-201.
  55. Complementing cappable degrees in the difference hierarchy (with Rod Downey and Angsheng Li), Annals of Pure and Applied Logic 125 (2004), 101-118.
  56. Degrees of d.c.e. reals (with Rod Downey and Xizhong Zheng), Mathematical Logic Quarterly 50 (2004) 345-350.
  57. Diamond embeddings into the d.c.e. degrees with 0 and 1 preserved, Proceedings of the 7th and 8th Asian Logic Conferences, World Scientific, 2003, 443-471.
  58. Q-measures on Qκλ, Archive for Mathematical Logic 42 (2003), 201-204.
  59. Isolation and the high/low hierarchy (with Shamil Ishmukhametov), Archive for Mathematical Logic 41 (2002), 259-266.
  60. Nonisolated degrees and the Jump Operator , Annals of Pure and Applied Logic 117 (2002), 209-221.
  61. Isolation and lattice embeddings, Journal of Symbolic Logic 67 (2002), 1055-1064.
  62. Prefix-free languages and initial segments of computably enumerable degrees, Computing and Combinatorics 2001, Lecture Notes in Computer Science volume 2108, 576-585.
  63. Isolation and the jump operator, Mathematical Logic Quarterly 47 (2001), 525-534.
  64. A hierarchy for cuppable degrees (with Angsheng Li and Zaiyue Zhang), Illinois Journal Mathematics 44 (2000), 619-632.
  65. Restrictions of filters, preservation of properties, and the weak partition property, Acta Mathematica Sinica 41 (1998), 999-1002.
  66. Nice orderings on the structure Qκλ, Acta Mathematica Sinica 40 (1997), 853-856.

Best viewed with Microsoft IE 6.0 and above