reduction to absurdity

基本解释

At present in logic people have different opinions on the question whether reduction to absurdity is direct refutation or indirect one.
在反驳方法中，归谬法究竟属于直接反驳还是间接反驳，目前的逻辑学界还存在着较为严重的分歧。
In this paper, it proves the theorem that a worst case bound is 4/3 for the MLPT - algorithm of 4 - partition problem with the reduction to absurdity.
采用反证法，证明了4—拆分问题的MLPT—算法，在一定条件限制下，最差情况性能界不超过4/3。
But the method of infinite approach is used more widely, it is a uninfinite procedure, and it only can achieve the desired results with reduction to absurdity.
而“穷竭法”适用范围更广，是一个有限过程，结合归谬法可以推论预期的结果。