Answers are grounded in this paper and cite their sources.
In this study we ask how logical systems are built in two-valued symbolic logic and which logical operator(s) should be taken as primitive. There are three criteria which are usually used to justify the choice of implication. These are functional completeness, inferential naturalness, and axiomatic economy. We show that the functional completeness and the axiomatic economy criteria do not point to implication, while inferential naturalness already presupposes it. This is why we need to propose a new criterion which will not presuppose the operator itself tests. This criterion is the independence of the conditional core from negation which we derive from modus ponens and the deduction theorem. A primitive implication performs this core from two axioms that do not involve negation. First, we consider a conditional which may be defined as ¬(A ∧ ¬B). We show that this definition requires double negation elimination to satisfy modus ponens. Second, a conditional may also be defined as ¬A ∨ B which requires ex falso quodlibet for modus ponens, and it needs the law of excluded middle for the deduction theorem. Our results suggest that if conditional reasoning is not to rely on contested principles of negation, the conditional should not be defined through negation, and the implication is the simplest primitive that achieves this.
No takes yet. Share an insight, caveat, or question.
Çetres et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: