at.logic.skeptik.algorithm.compressor
(multiSplit: (Proof[SequentProofNode], Guard[SequentProofNode]) ⇒ Proof[SequentProofNode]).apply(v1, v2)
(multiSplit: (Proof[SequentProofNode]) ⇒ Proof[SequentProofNode]).apply(v1)
(multiSplit: StringAdd).self
(multiSplit: StringFormat).self
(multiSplit: (Proof[SequentProofNode], Guard[SequentProofNode]) ⇒ Proof[SequentProofNode]).toString()
(multiSplit: (Proof[SequentProofNode]) ⇒ Proof[SequentProofNode]).toString()
(multiSplit: ArrowAssoc[MultiSplit]).x
(Since version 2.10.0) Use leftOfArrow
instead
(multiSplit: Ensuring[MultiSplit]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
Extended Split compression algorithm
A arbitrary number of variables are selected and the proof is split in 2^n subproofs.