Weaker D-Complete Logics
Norman D. Megill, Martin W. Bunder · Logic Journal of IGPL · 1996
BB′IW logic (or T→ is known to be D-complete. This paper shows that there are infinitely many weaker D-complete logics and it also examines how certain D-incomplete logics can be made complete by altering their axioms using simple substitutions.