Redundant proof
id:
redundant-proof-249-13683841
title:
Redundant proof
text:
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 κ ′ ⊆ κ and | ψ ′ | < | ψ | where | φ | is the number of nodes in φ .
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Redundant_proof
date created:
date modified:
2023-12-23T15:57:32Z
main entity:
{"identifier":"Q15964428","url":"https://www.wikidata.org/entity/Q15964428"}
image:
fields total:
13
integrity:
13