<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=157.89.212.93</id>
	<title>formulasearchengine - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=157.89.212.93"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/wiki/Special:Contributions/157.89.212.93"/>
	<updated>2026-05-02T09:11:33Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Downsampling&amp;diff=8171</id>
		<title>Downsampling</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Downsampling&amp;diff=8171"/>
		<updated>2014-01-30T21:59:54Z</updated>

		<summary type="html">&lt;p&gt;157.89.212.93: Changed use of the word &amp;quot;unity&amp;quot; to use of the word &amp;quot;one&amp;quot;. They mean the same thing here and &amp;quot;one&amp;quot; is less confusing to someone not familiar with the jargon of the field.&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Transformation rules}}&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Constructive dilemma&#039;&#039;&#039;&amp;lt;ref&amp;gt;Hurley, Patrick. A Concise Introduction to Logic With Ilrn Printed Access Card. Wadsworth Pub Co, 2008. Page 361&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Moore and Parker&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;Copi and Cohen&amp;lt;/ref&amp;gt; is a name of a [[validity|valid]] [[rule of inference]] of [[propositional calculus|propositional logic]]. It is the [[inference]] that, if &#039;&#039;P&#039;&#039; implies &#039;&#039;Q&#039;&#039; and &#039;&#039;R&#039;&#039; implies &#039;&#039;S&#039;&#039; and either &#039;&#039;P&#039;&#039; or &#039;&#039;R&#039;&#039; is true, then &#039;&#039;Q or S&#039;&#039; has to be true. In sum, if two [[material conditional|conditionals]] are true and at least one of their antecedents is, then at least one of their consequents must be too. &#039;&#039;Constructive dilemma&#039;&#039; is the [[Logical disjunction|disjunctive]] version of [[modus ponens]], whereas,&lt;br /&gt;
[[destructive dilemma]] is the disjunctive version of [[modus tollens]]. The rule can be stated:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\frac{P \to Q, R \to S, P \or R}{\therefore Q \or S}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where the rule is that whenever instances of &amp;quot;&amp;lt;math&amp;gt;P \to Q&amp;lt;/math&amp;gt;&amp;quot;, &amp;quot;&amp;lt;math&amp;gt;R \to S&amp;lt;/math&amp;gt;&amp;quot;, and &amp;quot;&amp;lt;math&amp;gt;P \or R&amp;lt;/math&amp;gt;&amp;quot; appear on lines of a proof, &amp;quot;&amp;lt;math&amp;gt;Q \or S&amp;lt;/math&amp;gt;&amp;quot; can be placed on a subsequent line.&lt;br /&gt;
&lt;br /&gt;
== Formal notation ==&lt;br /&gt;
The &#039;&#039;constructive dilemma&#039;&#039; rule may be written in [[sequent]] notation:&lt;br /&gt;
&lt;br /&gt;
: &amp;lt;math&amp;gt;(P \to Q), (R \to S), (P \or R) \vdash (Q \or S)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\vdash&amp;lt;/math&amp;gt; is a [[metalogic]]al symbol meaning that &amp;lt;math&amp;gt;Q \or S&amp;lt;/math&amp;gt; is a [[logical consequence|syntactic consequence]] of &amp;lt;math&amp;gt;P \to Q&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;R \to S&amp;lt;/math&amp;gt;, and &amp;lt;math&amp;gt;Q \or S&amp;lt;/math&amp;gt; in some [[formal system|logical system]];&lt;br /&gt;
&lt;br /&gt;
and expressed as a truth-functional [[tautology (logic)|tautology]] or [[theorem]] of propositional logic:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;(((P \to Q) \and (R \to S)) \and (P \or R)) \to (Q \or S)&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;Q&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;S&amp;lt;/math&amp;gt; are propositions expressed in some formal system.&lt;br /&gt;
&lt;br /&gt;
== Variable English ==&lt;br /&gt;
&lt;br /&gt;
If P then Q.&lt;br /&gt;
If R then S.&lt;br /&gt;
P or R.&lt;br /&gt;
Therefore, Q or S.&lt;br /&gt;
&lt;br /&gt;
== Natural language example ==&lt;br /&gt;
&lt;br /&gt;
:If I win a million dollars, I will donate it to an orphanage.&lt;br /&gt;
:If my friend wins a million dollars, he will donate it to a wildlife fund.&lt;br /&gt;
:Either I win a million dollars, or my friend wins a million dollars.&lt;br /&gt;
:Therefore, either an orphanage will get a million dollars, or a wildlife fund will get a million dollars.&lt;br /&gt;
&lt;br /&gt;
The dilemma derives its name because of the transfer of disjunctive operants.&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Constructive Dilemma}}&lt;br /&gt;
[[Category:Rules of inference]]&lt;br /&gt;
[[Category:Dilemmas]]&lt;br /&gt;
[[Category:Theorems in propositional logic]]&lt;/div&gt;</summary>
		<author><name>157.89.212.93</name></author>
	</entry>
</feed>