Exportation (logic)

Formal notation

The exportation rule may be written in sequent notation:

where is a metalogical symbol meaning that is a syntactic equivalent of in some logical system;

or in rule form:

,

where the rule is that wherever an instance of "" appears on a line of a proof, it can be replaced with "" and vice versa;

or as the statement of a truth-functional tautology or theorem of propositional logic:

where , , and are propositions expressed in some logical system.

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, De Morgan's Laws, the negation of the conditional statement, the Associative Property of conjunction, the negation of another conditional statement, and double negation again, in that order to derive the result.


Proposition Derivation
Given
Material implication
Material implication
Associativity
De Morgan's law
Material implication

Relation to functions

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

gollark: Well, I think ReCaptcha is mostly around so Google can gather data and not for protection of anything.
gollark: I was mostly joking about Rust.
gollark: FORTRAN would probably be faster if decades of processors had been optimized to run FORTRANy code.
gollark: You can pick either high-level, high speed, ~~or Rust~~.
gollark: I mean, Haskell is compiled and is slow...

References

  1. Hurley, Patrick (1991). A Concise Introduction to Logic 4th edition. Wadsworth Publishing. pp. 364–5.
  2. Copi, Irving M.; Cohen, Carl (2005). Introduction to Logic. Prentice Hall. p. 371.CS1 maint: ref=harv (link)
  3. Moore and Parker
  4. http://www.philosophypages.com/lg/e11b.htm
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.