Redundant proof

From testwiki
Jump to navigation Jump to search

Template:Technical

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. κsubsumesκ) and |ψ|<|ψ| where |φ| is the number of nodes in φ.[1]

Local redundancy

A proof containing a subproof of the shapes (here omitted pivotsTemplate:Explain indicate that the resolvents must be uniquely defined)

(ηη1)(ηη2) or η(η1(ηη2))

is locally redundant.

Indeed, both of these subproofs can be equivalently replaced by the shorter subproof η(η1η2). In the case of local redundancy, the pairs of redundant inferences having the same pivot occur close to each other in the proof. However, redundant inferences can also occur far apart in the proof.

The following definition generalizes local redundancy by considering inferences with the same pivot that occur within different contexts. We write ψ[η] to denote a proof-context ψ[] with a single placeholder replaced by the subproof η.

Global redundancy

A proof

ψ[ψ1[ηpη1]ψ2[ηpη2]] or ψ[ψ1[ηp(η1ψ2[ηpη2])]]

is potentially (globally) redundant. Furthermore, it is (globally) redundant if it can be rewritten to one of the following shorter proofs:

ψ[ηp(ψ1[η1]ψ2[η2])] or ηpψ[ψ1[η1]ψ2[η2]] or ψ[ψ1[η1]ψ2[η2]].

Example

The proof

η:p,qη1:¬p,rq,rpη3:¬qrqηη2:¬p,s,¬rq,s,¬rpη3s,¬rqψ:sr

is locally redundant as it is an instance of the first pattern in the definition ((ηpη1)η3)((ηpη2)η3).

  • The pattern is ψ[ψ1[ηpη1]ψ2[ηpη2]]
  • ψ1[]=ψ2[]=_η3 and ψ[]=_

But it is not globally redundant because the replacement terms according to the definition contain ψ1[η1]ψ2[η2] in all the cases and ψ1[η1]ψ2[η2]=(η1η3)(η2η3) does not correspond to a proof. In particular, neither η1 nor η2 can be resolved with η3, as they do not contain the literal q.

The second pattern of potentially globally redundant proofs appearing in global redundancy definition is related to the well-knownTemplate:Explain notion of regularityTemplate:Explain. Informally, a proof is irregular if there is a path from a node to the root of the proof such that a literal is used more than once as a pivot in this path.

Notes

Template:Reflist

  1. Fontaine, Pascal; Merz, Stephan; Woltzenlogel Paleo, Bruno. Compression of Propositional Resolution Proofs via Partial Regularization. 23rd International Conference on Automated Deduction, 2011.