reduction to absurdity

基本解釋

At present in logic people have different opinions on the question whether reduction to absurdity is direct refutation or indirect one.
在反駁方法中，歸謬法究竟屬于直接反駁還是間接反駁，目前的邏輯學(xué)界還存在著較為嚴重的分歧。
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.
而“窮竭法”適用范圍更廣，是一個有限過程，結(jié)合歸謬法可以推論預(yù)期的結(jié)果。