Redundant_proof
In mathematical logic, a redundant proof is a proof that has a subset that is a shorter proof of the same result. In other words, a proof is redundant if it has more proof steps than are actually necessary to prove the result. Formally, a proof of is considered redundant if there exists another proof of such that (i.e. ) and where is the number of nodes in .[1]
This article may be too technical for most readers to understand. (April 2014) |