| Publication | Date of Publication | Type |
|---|
Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
Theory of Computing Systems | 2013-04-15 | Paper |
The complexity of variable minimal formulas
Chinese Science Bulletin | 2010-10-08 | Paper |
Bounding non-GL2 and R.E.A.
Journal of Symbolic Logic | 2009-09-29 | Paper |
Absolutely non-computable predicates and functions in analysis
Mathematical Structures in Computer Science | 2009-03-24 | Paper |
Absolutely Non-effective Predicates and Functions in Computable Analysis
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Modulo computably enumerable degrees by cupping partners
Science in China. Series A | 2007-10-16 | Paper |
On definable filters in computably enumerable degrees
Annals of Pure and Applied Logic | 2007-06-25 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
On the definable ideal generated by the plus cupping c.e. degrees
Archive for Mathematical Logic | 2007-04-19 | Paper |
FC-normal and extended stratified logic program
Science in China. Series F | 2007-02-20 | Paper |
An extension of Harrington's noncupping theorem
Science in China. Series F | 2007-02-20 | Paper |
Computability of measurable sets via effective topologies
Archive for Mathematical Logic | 2006-03-22 | Paper |
Computability of measurable sets via effective metrics
MLQ | 2005-11-15 | Paper |
There is no SW-complete c.e. real
Journal of Symbolic Logic | 2005-08-29 | Paper |
Infimum properties differ in the weak truth-table degrees and the Turing degrees
Acta Mathematica Sinica, English Series | 2004-11-26 | Paper |
The Kolmogorov complexity of random reals
Annals of Pure and Applied Logic | 2004-11-22 | Paper |
| scientific article; zbMATH DE number 2097605 (Why is no real title available?) | 2004-09-07 | Paper |
There are 2^{ℵ₀} many 𝐻-degrees in the random reals
Proceedings of the American Mathematical Society | 2004-08-13 | Paper |
Characterization of an auto-compatible default theory
Journal of Computer Science and Technology | 2003-12-09 | Paper |
Fixed-parameter tractability of disjunction-free default reasoning
Journal of Computer Science and Technology | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1735624 (Why is no real title available?) | 2002-04-29 | Paper |
| Lattice embedding into d-r. e. degrees preserving 0 and 1 | 2002-04-24 | Paper |
Complexity results for 2CNF default theories
Fundamenta Informaticae | 2001-07-23 | Paper |
Complexity results for restricted credulous default reasoning
AI Communications | 2001-03-19 | Paper |
Two alternative notions of 'possibility' satisfying Halpern's conditions
Journal Of Logic And Computation | 2001-03-13 | Paper |
More on bounding introspection in modal nonmonotonic logics
Acta Mathematica Sinica, English Series | 2001-03-12 | Paper |
Two tractable subclasses of minimal unsatisfiable formulas
Science in China. Series A | 2000-02-28 | Paper |
| scientific article; zbMATH DE number 1088279 (Why is no real title available?) | 1997-11-17 | Paper |
Isolated d.r.e. degrees are dense in r.e. degree structure
Archive for Mathematical Logic | 1997-11-05 | Paper |
| scientific article; zbMATH DE number 979885 (Why is no real title available?) | 1997-06-03 | Paper |
| scientific article; zbMATH DE number 851063 (Why is no real title available?) | 1996-06-25 | Paper |
Isolated d-r.e. degree below r.e. degree
Science in China. Series A | 1995-12-18 | Paper |
| scientific article; zbMATH DE number 713379 (Why is no real title available?) | 1995-11-20 | Paper |
| scientific article; zbMATH DE number 749917 (Why is no real title available?) | 1995-08-27 | Paper |
| scientific article; zbMATH DE number 713479 (Why is no real title available?) | 1995-07-20 | Paper |
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees
Mathematical Logic Quarterly | 1995-06-08 | Paper |
Default logic about assertions
Science in China. Series A | 1995-02-13 | Paper |
Non-p-generic and strongly nonbranching degree
Acta Mathematica Sinica, English Series | 1994-09-19 | Paper |
| scientific article; zbMATH DE number 468943 (Why is no real title available?) | 1994-09-01 | Paper |
The density of noncontiguous degrees
Science in China. Series A | 1994-08-28 | Paper |
The structures inside Turing degrees of recursively enumerable generic sets
Chinese Science Bulletin | 1994-06-05 | Paper |
A comparison of frequencies of occurrence of \(p\)-generic and non-\(p\)- generic Turing degrees
Chinese Science Bulletin | 1994-06-05 | Paper |
The distribution of the generic recursively enumerable degrees
Archive for Mathematical Logic | 1993-11-30 | Paper |
Density of non-p-generic and non-branching r.e. degrees in r.e. low degrees
Science in China. Series A | 1993-08-17 | Paper |
| scientific article; zbMATH DE number 62976 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 49757 (Why is no real title available?) | 1992-09-17 | Paper |
| scientific article; zbMATH DE number 4023250 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4031658 (Why is no real title available?) | 1987-01-01 | Paper |
Density of recursively inseparable R. E. Sets and universal recrusively inseparability
Acta Mathematica Sinica, English Series | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4035809 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4037858 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4037859 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3900735 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3902640 (Why is no real title available?) | 1984-01-01 | Paper |
