Corresponding conditional

<h2 id="example">Example</h2>
Consider the argument A:

<blockquote>
Either it is hot or it is cold
It is not hot
Therefore it is cold

</blockquote>
This argument is of the form:

<blockquote>
Either P or Q 
Not P 
Therefore Q
or (using standard symbols of <a href="/facts/Propositional_calculus/MNt5v31V">propositional calculus</a>):
P 
 
 
 
 ∨
 
 
 {\displaystyle \lor }
 
 Q

¬
 
 
 {\displaystyle \neg }
 
P
____________
Q

</blockquote>
The corresponding conditional C is:

<blockquote>
IF ((P or Q) and not P) THEN Q 
or (using standard symbols):
((P 
 
 
 
 ∨
 
 
 {\displaystyle \lor }
 
 Q) 
 
 
 
 ∧
 
 
 {\displaystyle \wedge }
 
 
 
 
 
 ¬
 
 
 {\displaystyle \neg }
 
P)
 
 
 
 →
 
 
 {\displaystyle \to }
 
 Q

</blockquote>
and the argument A is valid just in case the corresponding conditional C is a logical truth.
If C is a logical truth then 
 
 
 
 ¬
 
 
 {\displaystyle \neg }
 
C entails Falsity (The False).
Thus, any argument is valid if and only if the denial of its corresponding conditional leads to a contradiction.
If we construct a <a href="/facts/Truth_table/4KsmArDW">truth table</a> for C we will find that it comes out T (true) on every row (and of course if we construct a truth table for the negation of C it will come out F (false) in every row. These results confirm the validity of the argument A
Some arguments need <a href="/facts/First-order_logic/lcISqWIg">first-order predicate logic</a> to reveal their forms and they cannot be tested properly by truth tables forms.
Consider the argument A1:

<blockquote>
Some mortals are not Greeks
Some Greeks are not men
Not every man is a logician
Therefore Some mortals are not logicians

</blockquote>
To test this argument for validity, construct the corresponding conditional C1 (you will need first-order predicate logic), negate it, and see if you can derive a contradiction from it. If you succeed, then the argument is valid.

<h2 id="application">Application</h2>
Instead of attempting to derive the conclusion from the premises proceed as follows.
To test the validity of an argument (a) translate, as necessary, each premise and the conclusion into sentential or predicate logic sentences (b) construct from these the negation of the corresponding conditional (c) see if from it a contradiction can be derived (or if feasible construct a truth table for it and see if it comes out false on every row.) Alternatively construct a truth tree and see if every branch is closed. Success proves the validity of the original argument.
In case of the difficulty in trying to derive a contradiction, one should proceed as follows. From the negation of the corresponding conditional derive a theorem in <a href="/facts/Conjunctive_normal_form/B3sY1lTW">conjunctive normal form</a> in the methodical fashions described in text books. If, and only if, the original argument was valid will the theorem in conjunctive normal form be a contradiction, and if it is, then that it is will be apparent. 

<h2 id="further-reading">Further reading</h2>
<ul><li>Cauman, Leigh S. (1998). First-order Logic: An Introduction. Walter de Gruyter. p. 19. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 3-11-015766-7.</li></ul>
<ul><li>Skorupski, John (1998). <a href="https://archive.org/details/cambridgecompani0000unse_z7h9/page/40">The Cambridge Companion to Mill</a>. Cambridge University Press. p. <a href="https://archive.org/details/cambridgecompani0000unse_z7h9/page/40">40</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-521-42211-6.</li></ul>
<ul><li>Guttenplan, Samuel D. (1997). The Languages of Logic: An Introduction to Formal Logic. Blackwell Publishing. p. 90. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 1-55786-988-X.</li></ul>
<ul><li>Kvanvig, Jonathan L. (2003). The Value of Knowledge and the Pursuit of Understanding. Cambridge University Press. p. 175. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-521-82713-2.</li></ul>
<ul><li>Tomassi, Paul (1999). Logic. Routledge. p. 153. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-415-16696-9.</li></ul>
<h2 id="external-links">External links</h2>
<ul><li><a href="https://web.archive.org/web/20070221225317/http://www.swif.uniba.it/lei/foldop/foldoc.cgi?corresponding+conditional">Corresponding conditional from the Free On-line Dictionary of Computing</a></li>
<li><a href="https://books.google.com/books?id=TQlvJJgUiVoC&pg=PA19">https://books.google.com/books?id=TQlvJJgUiVoC&pg=PA19</a></li>
<li><a href="https://books.google.com/books?id=BVHwg_qNxosC&pg=PA40">https://books.google.com/books?id=BVHwg_qNxosC&pg=PA40</a></li>
<li><a href="http://www.earlham.edu/~peters/courses/log/terms2.htm">http://www.earlham.edu/~peters/courses/log/terms2.htm</a></li>
<li><a href="http://www.csus.edu/indiv/n/nogalesp/SymbolicLogicGustason/SymbolicLogicOverheads/Phil60GusCh2TruthTablesSemanticMethods/TTValidityCorrespondingConditional.doc">http://www.csus.edu/indiv/n/nogalesp/SymbolicLogicGustason/SymbolicLogicOverheads/Phil60GusCh2TruthTablesSemanticMethods/TTValidityCorrespondingConditional.doc</a></li>
<li><a href="https://books.google.com/books?id=xfOdpyj1bSIC&pg=PA90">https://books.google.com/books?id=xfOdpyj1bSIC&pg=PA90</a></li>
<li><a href="https://books.google.com/books?id=OxXopc5AjQ0C&pg=PA175">https://books.google.com/books?id=OxXopc5AjQ0C&pg=PA175</a></li>
<li><a href="https://books.google.com/books?id=tb6bxjyrFJ4C&pg=PA153">https://books.google.com/books?id=tb6bxjyrFJ4C&pg=PA153</a></li></ul>

Corresponding conditional open-in-new

Corresponding conditional