Lesson plan
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 \psi of \kappa is considered redundant if there exists another proof \psi^{\prime} of \kappa^{\prime} such that \kappa^{\prime}\subseteq\kappa (i.e. \kappa^{\prime} \;\text{subsumes}\; \kappa ) and |\psi^{\prime}| where |\varphi| is the number of nodes in \varphi .
Article summary
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 \psi of \kappa is considered redundant if there exists another proof \psi^{\prime} of \kappa^{\prime} such that \kappa^{\prime}\subseteq\kappa (i.e. \kappa^{\prime} \;\text{subsumes}\; \kappa ) and |\psi^{\prime}| where |\varphi| is the number of nodes in \varphi .
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.