Misplaced Pages

Material conditional

IMPLY
Definition	${\displaystyle x\rightarrow y}$
Truth table	${\displaystyle (1011)}$
Logic gate
Normal forms
Disjunctive	${\displaystyle {\overline {x}}+y}$
Conjunctive	${\displaystyle {\overline {x}}+y}$
Zhegalkin polynomial	${\displaystyle 1\oplus x\oplus xy}$
Post's lattices
0-preserving	no
1-preserving	yes
Monotone	no
Affine	no
Self-dual	no
v t e

Logical connectives
NOT ${\displaystyle \neg A}$, ${\displaystyle -A}$, ${\displaystyle {\overline {A}}}$, ${\displaystyle \sim A}$ AND ${\displaystyle A\land B}$, ${\displaystyle A\cdot B}$, ${\displaystyle AB}$, ${\displaystyle A\&B}$, ${\displaystyle A\&\&B}$ NAND ${\displaystyle A{\overline {\land }}B}$, ${\displaystyle A\uparrow B}$, ${\displaystyle A\mid B}$, ${\displaystyle {\overline {A\cdot B}}}$ OR ${\displaystyle A\lor B}$, ${\displaystyle A+B}$, ${\displaystyle A\mid B}$, ${\displaystyle A\parallel B}$ NOR ${\displaystyle A{\overline {\lor }}B}$, ${\displaystyle A\downarrow B}$, ${\displaystyle {\overline {A+B}}}$ XNOR ${\displaystyle A\ {\text{XNOR}}\ B}$ └ equivalent ${\displaystyle A\equiv B}$, ${\displaystyle A\Leftrightarrow B}$, ${\displaystyle A\leftrightharpoons B}$ XOR ${\displaystyle A{\underline {\lor }}B}$, ${\displaystyle A\oplus B}$ └nonequivalent ${\displaystyle A\not \equiv B}$, ${\displaystyle A\not \Leftrightarrow B}$, ${\displaystyle A\nleftrightarrow B}$ implies ${\displaystyle A\Rightarrow B}$, ${\displaystyle A\supset B}$, ${\displaystyle A\rightarrow B}$ converse ${\displaystyle A\Leftarrow B}$, ${\displaystyle A\subset B}$, ${\displaystyle A\leftarrow B}$
Related concepts
Propositional calculus Predicate logic Boolean algebra Truth table Truth function Boolean function Functional completeness Scope (logic)
Applications
Digital logic Programming languages Mathematical logic Philosophy of logic
Category
v t e

The material conditional (also known as material implication) is an operation commonly used in logic. When the conditional symbol ${\displaystyle \rightarrow }$ is interpreted as material implication, a formula ${\displaystyle P\rightarrow Q}$ is true unless ${\displaystyle P}$ is true and ${\displaystyle Q}$ is false. Material implication can also be characterized inferentially by modus ponens, modus tollens, conditional proof, and classical reductio ad absurdum.

Material implication is used in all the basic systems of classical logic as well as some nonclassical logics. It is assumed as a model of correct conditional reasoning within mathematics and serves as the basis for commands in many programming languages. However, many logics replace material implication with other operators such as the strict conditional and the variably strict conditional. Due to the paradoxes of material implication and related problems, material implication is not generally considered a viable analysis of conditional sentences in natural language.

Notation

In logic and related fields, the material conditional is customarily notated with an infix operator ${\displaystyle \to }$. The material conditional is also notated using the infixes ${\displaystyle \supset }$ and ${\displaystyle \Rightarrow }$. In the prefixed Polish notation, conditionals are notated as ${\displaystyle Cpq}$. In a conditional formula ${\displaystyle p\to q}$, the subformula ${\displaystyle p}$ is referred to as the antecedent and ${\displaystyle q}$ is termed the consequent of the conditional. Conditional statements may be nested such that the antecedent or the consequent may themselves be conditional statements, as in the formula ${\displaystyle (p\to q)\to (r\to s)}$.

History

In Arithmetices Principia: Nova Methodo Exposita (1889), Peano expressed the proposition "If ${\displaystyle A}$, then ${\displaystyle B}$" as ${\displaystyle A}$ Ɔ ${\displaystyle B}$ with the symbol Ɔ, which is the opposite of C. He also expressed the proposition ${\displaystyle A\supset B}$ as ${\displaystyle A}$ Ɔ ${\displaystyle B}$. Hilbert expressed the proposition "If A, then B" as ${\displaystyle A\to B}$ in 1918. Russell followed Peano in his Principia Mathematica (1910–1913), in which he expressed the proposition "If A, then B" as ${\displaystyle A\supset B}$. Following Russell, Gentzen expressed the proposition "If A, then B" as ${\displaystyle A\supset B}$. Heyting expressed the proposition "If A, then B" as ${\displaystyle A\supset B}$ at first but later came to express it as ${\displaystyle A\to B}$ with a right-pointing arrow. Bourbaki expressed the proposition "If A, then B" as ${\displaystyle A\Rightarrow B}$ in 1954.

Definitions

Semantics

From a classical semantic perspective, material implication is the binary truth functional operator which returns "true" unless its first argument is true and its second argument is false. This semantics can be shown graphically in a truth table such as the one below. One can also consider the equivalence ${\displaystyle A\to B\equiv \neg (A\land \neg B)\equiv \neg A\lor B}$.

Truth table

The truth table of ${\displaystyle A\rightarrow B}$:

${\displaystyle A}$	${\displaystyle B}$	${\displaystyle A\rightarrow B}$
F	F	T
F	T	T
T	F	F
T	T	T

The logical cases where the antecedent A is false and A → B is true, are called "vacuous truths". Examples are ...

• ... with B false: "If Marie Curie is a sister of Galileo Galilei, then Galileo Galilei is a brother of Marie Curie",
• ... with B true: "If Marie Curie is a sister of Galileo Galilei, then Marie Curie has a sibling.".

Deductive definition

Material implication can also be characterized deductively in terms of the following rules of inference.

• Modus ponens
• Conditional proof
• Classical contraposition
• Classical reductio ad absurdum

Unlike the semantic definition, this approach to logical connectives permits the examination of structurally identical propositional forms in various logical systems, where somewhat different properties may be demonstrated. For example, in intuitionistic logic, which rejects proofs by contraposition as valid rules of inference, ${\displaystyle (A\to B)\Rightarrow \neg A\lor B}$ is not a propositional theorem, but the material conditional is used to define negation.

Formal properties

This section needs expansion. You can help by adding to it. (February 2021)

When disjunction, conjunction and negation are classical, material implication validates the following equivalences:

• Contraposition: ${\displaystyle P\to Q\equiv \neg Q\to \neg P}$
• Import-export: ${\displaystyle P\to (Q\to R)\equiv (P\land Q)\to R}$
• Negated conditionals: ${\displaystyle \neg (P\to Q)\equiv P\land \neg Q}$
• Or-and-if: ${\displaystyle P\to Q\equiv \neg P\lor Q}$
• Commutativity of antecedents: ${\displaystyle {\big (}P\to (Q\to R){\big )}\equiv {\big (}Q\to (P\to R){\big )}}$
• Left distributivity: ${\displaystyle {\big (}R\to (P\to Q){\big )}\equiv {\big (}(R\to P)\to (R\to Q){\big )}}$

Similarly, on classical interpretations of the other connectives, material implication validates the following entailments:

• Antecedent strengthening: ${\displaystyle P\to Q\models (P\land R)\to Q}$
• Vacuous conditional: ${\displaystyle \neg P\models P\to Q}$
• Transitivity: ${\displaystyle (P\to Q)\land (Q\to R)\models P\to R}$
• Simplification of disjunctive antecedents: ${\displaystyle (P\lor Q)\to R\models (P\to R)\land (Q\to R)}$

Tautologies involving material implication include:

• Reflexivity: ${\displaystyle \models P\to P}$
• Totality: ${\displaystyle \models (P\to Q)\lor (Q\to P)}$
• Conditional excluded middle: ${\displaystyle \models (P\to Q)\lor (P\to \neg Q)}$

Discrepancies with natural language

Material implication does not closely match the usage of conditional sentences in natural language. For example, even though material conditionals with false antecedents are vacuously true, the natural language statement "If 8 is odd, then 3 is prime" is typically judged false. Similarly, any material conditional with a true consequent is itself true, but speakers typically reject sentences such as "If I have a penny in my pocket, then Paris is in France". These classic problems have been called the paradoxes of material implication. In addition to the paradoxes, a variety of other arguments have been given against a material implication analysis. For instance, counterfactual conditionals would all be vacuously true on such an account.

In the mid-20th century, a number of researchers including H. P. Grice and Frank Jackson proposed that pragmatic principles could explain the discrepancies between natural language conditionals and the material conditional. On their accounts, conditionals denote material implication but end up conveying additional information when they interact with conversational norms such as Grice's maxims. Recent work in formal semantics and philosophy of language has generally eschewed material implication as an analysis for natural-language conditionals. In particular, such work has often rejected the assumption that natural-language conditionals are truth functional in the sense that the truth value of "If P, then Q" is determined solely by the truth values of P and Q. Thus semantic analyses of conditionals typically propose alternative interpretations built on foundations such as modal logic, relevance logic, probability theory, and causal models.

Similar discrepancies have been observed by psychologists studying conditional reasoning, for instance, by the notorious Wason selection task study, where less than 10% of participants reasoned according to the material conditional. Some researchers have interpreted this result as a failure of the participants to conform to normative laws of reasoning, while others interpret the participants as reasoning normatively according to nonclassical laws.

See also

• Boolean domain
• Boolean function
• Boolean logic
• Conditional quantifier
• Implicational propositional calculus
• Laws of Form
• Logical graph
• Logical equivalence
• Material implication (rule of inference)
• Peirce's law
• Propositional calculus
• Sole sufficient operator

Conditionals

• Corresponding conditional
• Counterfactual conditional
• Indicative conditional
• Strict conditional

Notes

1. Note that the horseshoe symbol Ɔ has been flipped to become a subset symbol ⊂.

References

1. ^ Hilbert, D. (1918). Prinzipien der Mathematik (Lecture Notes edited by Bernays, P.).
2. Mendelson, Elliott (2015). Introduction to Mathematical Logic (6th ed.). Boca Raton: CRC Press/Taylor & Francis Group (A Chapman & Hall Book). p. 2. ISBN 978-1-4822-3778-8.
3. Jean van Heijenoort, ed. (1967). From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931. Harvard University Press. pp. 84–87. ISBN 0-674-32449-8.
4. Michael Nahas (25 Apr 2022). "English Translation of 'Arithmetices Principia, Nova Methodo Exposita'" (PDF). GitHub. p. VI. Retrieved 2022-08-10.
5. Mauro ALLEGRANZA (2015-02-13). "elementary set theory – Is there any connection between the symbol ⊃ when it means implication and its meaning as superset?". Mathematics Stack Exchange. Stack Exchange Inc. Answer. Retrieved 2022-08-10.
6. Bourbaki, N. (1954). Théorie des ensembles. Paris: Hermann & Cie, Éditeurs. p. 14.
7. ^ Edgington, Dorothy (2008). "Conditionals". In Edward N. Zalta (ed.). The Stanford Encyclopedia of Philosophy (Winter 2008 ed.).
8. Starr, Will (2019). "Counterfactuals". In Zalta, Edward N. (ed.). The Stanford Encyclopedia of Philosophy.
9. ^ Gillies, Thony (2017). "Conditionals" (PDF). In Hale, B.; Wright, C.; Miller, A. (eds.). A Companion to the Philosophy of Language. Wiley Blackwell. pp. 401–436. doi:10.1002/9781118972090.ch17. ISBN 9781118972090.
10. von Fintel, Kai (2011). "Conditionals" (PDF). In von Heusinger, Klaus; Maienborn, Claudia; Portner, Paul (eds.). Semantics: An international handbook of meaning. de Gruyter Mouton. pp. 1515–1538. doi:10.1515/9783110255072.1515. hdl:1721.1/95781. ISBN 978-3-11-018523-2.
11. Oaksford, M.; Chater, N. (1994). "A rational analysis of the selection task as optimal data selection". Psychological Review. 101 (4): 608–631. CiteSeerX 10.1.1.174.4085. doi:10.1037/0033-295X.101.4.608. S2CID 2912209.
12. Stenning, K.; van Lambalgen, M. (2004). "A little logic goes a long way: basing experiment on semantic theory in the cognitive science of conditional reasoning". Cognitive Science. 28 (4): 481–530. CiteSeerX 10.1.1.13.1854. doi:10.1016/j.cogsci.2004.02.002.
13. von Sydow, M. (2006). Towards a Flexible Bayesian and Deontic Logic of Testing Descriptive and Prescriptive Rules (doctoralThesis). Göttingen: Göttingen University Press. doi:10.53846/goediss-161. S2CID 246924881.

Further reading

• Brown, Frank Markham (2003), Boolean Reasoning: The Logic of Boolean Equations, 1st edition, Kluwer Academic Publishers, Norwell, MA. 2nd edition, Dover Publications, Mineola, NY, 2003.
• Edgington, Dorothy (2001), "Conditionals", in Lou Goble (ed.), The Blackwell Guide to Philosophical Logic, Blackwell.
• Quine, W.V. (1982), Methods of Logic, (1st ed. 1950), (2nd ed. 1959), (3rd ed. 1972), 4th edition, Harvard University Press, Cambridge, MA.
• Stalnaker, Robert, "Indicative Conditionals", Philosophia, 5 (1975): 269–286.

External links

• Media related to Material conditional at Wikimedia Commons
• Edgington, Dorothy. "Conditionals". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy.

v t e Common logical connectives
Tautology/True ${\displaystyle \top }$
Alternative denial (NAND gate) ${\displaystyle \uparrow }$ Converse implication ${\displaystyle \leftarrow }$ Implication (IMPLY gate) ${\displaystyle \rightarrow }$ Disjunction (OR gate) ${\displaystyle \lor }$
Negation (NOT gate) ${\displaystyle \neg }$ Exclusive or (XOR gate) ${\displaystyle \not \leftrightarrow }$ Biconditional (XNOR gate) ${\displaystyle \leftrightarrow }$ Statement (Digital buffer)
Joint denial (NOR gate) ${\displaystyle \downarrow }$ Nonimplication (NIMPLY gate) ${\displaystyle \nrightarrow }$ Converse nonimplication ${\displaystyle \nleftarrow }$ Conjunction (AND gate) ${\displaystyle \land }$
Contradiction/False ${\displaystyle \bot }$
Philosophy portal

v t e Common logical symbols
∧  or  & and ∨ or ¬  or  ~ not → implies ⊃ implies, superset ↔  or  ≡ iff | nand ∀ universal quantification ∃ existential quantification ⊤ true, tautology ⊥ false, contradiction ⊢ entails, proves ⊨ entails, therefore ∴ therefore ∵ because
Philosophy portal Mathematics portal

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

• Logical connectives
• Conditionals
• Logical consequence
• Semantics