Importation (logic)
   HOME

TheInfoList



OR:

Exportation is a valid
rule of replacement In logic, a rule of replacementMoore and Parker is a transformation rule that may be applied to only a particular segment of an logical expression, expression. A logical system may be constructed so that it uses either axioms, rules of inference ...
in
propositional logic Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions (which can be true or false) and relations b ...
. The rule allows conditional statements having conjunctive antecedents to be replaced by statements having conditional
consequent A consequent is the second half of a hypothetical proposition. In the standard form of such a proposition, it is the part that follows "then". In an implication, if ''P'' implies ''Q'', then ''P'' is called the antecedent and ''Q'' is called ...
s and vice versa in logical proofs. It is the rule that: ((P \land Q) \to R) \Leftrightarrow (P \to (Q \to R)) Where "\Leftrightarrow" is a
metalogic Metalogic is the study of the metatheory of logic. Whereas ''logic'' studies how logical systems can be used to construct valid and sound arguments, metalogic studies the properties of logical systems.Harry GenslerIntroduction to Logic Routledge, ...
al symbol representing "can be replaced in a proof with." In strict terminology, ((P \land Q) \to R) \Rightarrow (P \to (Q \to R)) is the law of exportation, for it "exports" a proposition from the antecedent of (P \land Q) \to R to its consequent. Its converse, the law of importation, (P \to (Q \to R))\Rightarrow ((P \land Q) \to R) , "imports" a proposition from the consequent of P \to (Q \to R) to its antecedent.


Formal notation

The ''exportation'' rule may be written in
sequent In mathematical logic, a sequent is a very general kind of conditional assertion. : A_1,\,\dots,A_m \,\vdash\, B_1,\,\dots,B_n. A sequent may have any number ''m'' of condition formulas ''Ai'' (called " antecedents") and any number ''n'' of ass ...
notation: :((P \land Q) \to R) \dashv\vdash (P \to (Q \to R)) where \dashv\vdash is a metalogical symbol meaning that (P \to (Q \to R)) is a syntactic equivalent of ((P \land Q) \to R) in some
logical system A formal system is an abstract structure used for inferring theorems from axioms according to a set of rules. These rules, which are used for carrying out the inference of theorems from axioms, are the logical calculus of the formal system. A form ...
; or in rule form: :\frac, \frac. where the rule is that wherever an instance of "(P \land Q) \to R" appears on a line of a proof, it can be replaced with "P \to (Q \to R)" and vice versa; or as the statement of a truth-functional tautology or
theorem In mathematics, a theorem is a statement that has been proved, or can be proved. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of t ...
of propositional logic: :((P \land Q) \to R) \leftrightarrow (P \to (Q \to R)) where P, Q, and R are propositions expressed in some
logical system A formal system is an abstract structure used for inferring theorems from axioms according to a set of rules. These rules, which are used for carrying out the inference of theorems from axioms, are the logical calculus of the formal system. A form ...
.


Natural language


Truth values

At any time, if P→Q is true, it can be replaced by P→(P∧Q).
One possible case for P→Q is for P to be true and Q to be true; thus P∧Q is also true, and P→(P∧Q) is true.
Another possible case sets P as false and Q as true. Thus, P∧Q is false and P→(P∧Q) is false; false→false is true.
The last case occurs when both P and Q are false. Thus, P∧Q is false and P→(P∧Q) is true.


Example

It rains and the sun shines implies that there is a rainbow.
Thus, if it rains, then the sun shines implies that there is a rainbow. If my car is on, when I switch the gear to D the car starts going. If my car is on and I have switched the gear to D, then the car must start going.


Proof

The following proof uses material implication,
double negation In propositional logic, double negation is the theorem that states that "If a statement is true, then it is not the case that the statement is not true." This is expressed by saying that a proposition ''A'' is logically equivalent to ''not (not ...
,
De Morgan's laws In propositional logic and Boolean algebra, De Morgan's laws, also known as De Morgan's theorem, are a pair of transformation rules that are both valid rules of inference. They are named after Augustus De Morgan, a 19th-century British math ...
, the negation of the conditional statement, the
associative property In mathematics, the associative property is a property of some binary operations, which means that rearranging the parentheses in an expression will not change the result. In propositional logic, associativity is a valid rule of replacemen ...
of conjunction, the negation of another conditional statement, and double negation again, in that order to derive the result.


Relation to functions

Exportation is associated with currying via the Curry–Howard correspondence.


References

{{Reflist Rules of inference Theorems in propositional logic