Decheng Ding

From MaRDI portal
Person:162006

Available identifiers

zbMath Open ding.dechengMaRDI QIDQ162006

List of research outcomes





PublicationDate of PublicationType
Maximal pairs of computably enumerable sets in the computably Lipschitz degrees2013-04-15Paper
The complexity of variable minimal formulas2010-10-08Paper
Bounding non-GL2 and R.E.A.2009-09-29Paper
Absolutely non-computable predicates and functions in analysis2009-03-24Paper
Absolutely Non-effective Predicates and Functions in Computable Analysis2007-11-13Paper
Modulo computably enumerable degrees by cupping partners2007-10-16Paper
On definable filters in computably enumerable degrees2007-06-25Paper
Theory and Applications of Models of Computation2007-04-30Paper
Theory and Applications of Models of Computation2007-04-30Paper
On the definable ideal generated by the plus cupping c.e. degrees2007-04-19Paper
FC-normal and extended stratified logic program2007-02-20Paper
An extension of Harrington's noncupping theorem2007-02-20Paper
Computability of measurable sets via effective topologies2006-03-22Paper
Computability of measurable sets via effective metrics2005-11-15Paper
There is no SW-complete c.e. real2005-08-29Paper
Infimum properties differ in the weak truth-table degrees and the Turing degrees2004-11-26Paper
The Kolmogorov complexity of random reals2004-11-22Paper
https://portal.mardi4nfdi.de/entity/Q48138922004-09-07Paper
There are 2^{ℵ₀} many 𝐻-degrees in the random reals2004-08-13Paper
Characterization of an auto-compatible default theory2003-12-09Paper
Fixed-parameter tractability of disjunction-free default reasoning2003-08-13Paper
https://portal.mardi4nfdi.de/entity/Q43290062002-04-29Paper
Lattice embedding into d-r. e. degrees preserving 0 and 12002-04-24Paper
Complexity results for 2CNF default theories2001-07-23Paper
Complexity results for restricted credulous default reasoning2001-03-19Paper
Two alternative notions of 'possibility' satisfying Halpern's conditions2001-03-13Paper
More on bounding introspection in modal nonmonotonic logics2001-03-12Paper
Two tractable subclasses of minimal unsatisfiable formulas2000-02-28Paper
https://portal.mardi4nfdi.de/entity/Q43645951997-11-17Paper
Isolated d.r.e. degrees are dense in r.e. degree structure1997-11-05Paper
https://portal.mardi4nfdi.de/entity/Q43330711997-06-03Paper
https://portal.mardi4nfdi.de/entity/Q48676811996-06-25Paper
Isolated d-r.e. degree below r.e. degree1995-12-18Paper
https://portal.mardi4nfdi.de/entity/Q43201531995-11-20Paper
https://portal.mardi4nfdi.de/entity/Q47640991995-08-27Paper
https://portal.mardi4nfdi.de/entity/Q43202621995-07-20Paper
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees1995-06-08Paper
Default logic about assertions1995-02-13Paper
Non-p-generic and strongly nonbranching degree1994-09-19Paper
https://portal.mardi4nfdi.de/entity/Q42723531994-09-01Paper
The density of noncontiguous degrees1994-08-28Paper
The structures inside Turing degrees of recursively enumerable generic sets1994-06-05Paper
A comparison of frequencies of occurrence of \(p\)-generic and non-\(p\)- generic Turing degrees1994-06-05Paper
The distribution of the generic recursively enumerable degrees1993-11-30Paper
Density of non-p-generic and non-branching r.e. degrees in r.e. low degrees1993-08-17Paper
https://portal.mardi4nfdi.de/entity/Q40086021992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39995491992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q37657541987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37721971987-01-01Paper
Density of recursively inseparable R. E. Sets and universal recrusively inseparability1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37755421986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37780181986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37780191986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36791651984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808221984-01-01Paper

Research outcomes over time

This page was built for person: Decheng Ding