In mathematical logic, a redundant proof is a proof that has a subset that is a shorter proof of the same result. That is, a proof of is considered redundant if there exists another proof of such that and where is the number of nodes in .

Auto-curated

Playing 1/7

### How to Redundancy Proof Your Future: If You Were Made Redundant, How Would You Cope?

YouTube 03:53### I have been made redundant

YouTube 01:55### How to Redundancy Proof Your Future: If You Were Made Redundant, How Would You Cope?

YouTube 03:53### How to Redundancy Proof Your Future: If You Were Made Redundant, How Would You Cope?

YouTube 03:53### SafeLogic Xtreme by SECURAM Systems - EMP-Proof - Redundant Safe Lock, updated August 3 2020

YouTube 02:05### Mathematics and Logic: From Euclid to Modern Geometry | Online Courses Trailer

YouTube 02:15### What is a Mathematical Proof: Introduction to Mathematical Reasoning #1

YouTube 03:41

In mathematical logic, a redundant proof is a proof that has a subset that is a shorter proof of the same result. That is, a proof of is considered redundant if there exists another proof of such that and where is the number of nodes in .

Discover in context