In logic, a constructive dilemma is a formal logical argument that takes the form: 1a) P → Q. b) R → S. 2) Either P or R is true. Therefore, either Q or S is true. In logical operator notation <math> P \rightarrow Q </math> <math> R \rightarrow S </math> <math> P \lor R </math> <math> \therefore Q \lor S </math>.
| Property | Value |
| dbpprop:abstract
|
- In logic, a constructive dilemma is a formal logical argument that takes the form: 1a) P → Q. b) R → S. 2) Either P or R is true. Therefore, either Q or S is true. In logical operator notation <math> P \rightarrow Q </math> <math> R \rightarrow S </math> <math> P \lor R </math> <math> \therefore Q \lor S </math>. In sum, if two conditionals are true and at least one of their antecedents is, then at least one of their consequents must be too. An example: If I win a million dollars, I will donate it to an orphanage. If my friend wins a million dollars, he will donate it to a wildlife fund. Either I win a million dollars, or my friend wins a million dollars. Therefore, either an orphanage will get a million dollars, or a wildlife fund will get a million dollars. The dilemma derives its name because of the transfer of disjunctive operants.
|
| dbpprop:hasPhotoCollection
| |
| rdf:type
| |
| rdfs:comment
|
- In logic, a constructive dilemma is a formal logical argument that takes the form: 1a) P → Q. b) R → S. 2) Either P or R is true. Therefore, either Q or S is true. In logical operator notation <math> P \rightarrow Q </math> <math> R \rightarrow S </math> <math> P \lor R </math> <math> \therefore Q \lor S </math>.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:page
| |
| is owl:sameAs
of | |