Note on D-completeness and prelinearity

Abstract

We prove that any set of axioms containing B, B', and the prelinearity axiom is D-complete, i.e. the very same formulae are provable with the rule of condensed detachment as are with modus ponens and substitution.

Keywords

• logic
• proof theory
• condensed detachment
• prelinearity