Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Process of elimination
open-in-new
<h2 id="method">Method</h2> <p>The method of elimination is <a href="/facts/Iterative_algorithm/uKMAJhEh">iterative</a>. One looks at the answers, determines that several answers are unfit, eliminates these, and repeats, until one cannot eliminate any more. This iteration is most effectively applied when there is <a href="/facts/Logic/8JnpJLtt">logical</a> structure between the answers – that is to say, when by eliminating an answer one can eliminate several others. In this case one can find the answers which one cannot eliminate by eliminating any other answers and test them alone – the others are eliminated as a <a href="/facts/Logical_consequence/AyDXp4dn">logical consequence</a>; this is the idea behind optimizations for computerized searches when the input is sorted – as, for instance, in <a href="/facts/Binary_search_algorithm/FFmQzunc">binary search</a>. </p><p>In order for the method to work it is necessary to list all possible, even improbable, possibilities. Any omissions render the method invalid as a <a href="/facts/Logic/8JnpJLtt">logical</a> method. </p> <h2 id="medicine">Medicine</h2> <p>A process of elimination can be used to reach a <a href="/facts/Diagnosis_of_exclusion/VBFyjqr3">diagnosis of exclusion</a>. It is an underlying method in performing a <a href="/facts/Differential_diagnosis/jLqnn5hA">differential diagnosis</a>. </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Disjunctive_syllogism/cfnyp2wY">Disjunctive syllogism</a></li> <li><a href="/facts/Law_of_excluded_middle/tDhbugCN">Law of excluded middle</a></li> <li><a href="/facts/Philosophical_razor/5a0AwxnK">Philosophical razor</a></li> <li><a href="/facts/Troubleshooting/XtjnV5XF">Troubleshooting</a></li> <li><a href="/facts/Twenty_questions/p3mIkJ8D">twenty questions</a> Spoken word game using logic.</li></ul> <ul><li>Richard L. Burden, J. Douglas Faires (2000). <i>Numerical Analysis</i>, 7th ed. Brooks/Cole. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-534-38216-9.</li></ul>