Lably
Skip to content

Exportation (logic)

Rule of replacement in propositional logic

  • 2 min read
  • 4 chapters

Related on Lably

Through Propositional logic, Logical conjunction and Rule of inference

((P∧Q)→R)⇔(P→(Q→R))

Where "⇔" is a metalogical symbol representing "can be replaced in a proof with." In strict terminology, ((P∧Q)→R)⇒(P→(Q→R)) is the law of exportation, for it "exports" a proposition from the antecedent of (P∧Q)→R to its consequent. Its converse, the law of importation, (P→(Q→R))⇒((P∧Q)→R), "imports" a proposition from the consequent of P→(Q→R) to its antecedent.

Formal notation

The exportation rule may be written in sequent notation:

((P∧Q)→R)⊣⊢(P→(Q→R))

where ⊣⊢ is a metalogical symbol meaning that (P→(Q→R)) is a syntactic equivalent of ((P∧Q)→R) in some logical system;

or in rule form:

(P∧Q)→RP→(Q→R), P→(Q→R)(P∧Q)→R.

where the rule is that wherever an instance of "(P∧Q)→R" appears on a line of a proof, it can be replaced with "P→(Q→R)", and vice versa.

Import-export is a name given to the statement as a theorem or truth-functional tautology of propositional logic:

((P∧Q)→R)↔(P→(Q→R))

where P, Q, and R are propositions expressed in some logical system.

Sign in to keep reading

3 more chapters are free with a Lably account.

More in Foundations