從Hempel的“檢證的弔詭”檢討邏輯的條件語句－論二值邏輯的條件關係發展為三值邏輯蘊含關係的必要性

A Review of the Conditional of Logic from Hempel's Paradoxes of Confirmation-On the Necessity of the Development of the Conditional of a Two-valued Logic into the Implication of a Three-valued Logic

楊植勝(Zhi-Sheng Yang)

《哲學與文化》 24卷1期 (1997/01) Pp. 33-46

https://doi.org/10.7065/MRPC.199701.0033

摘要

從Hempel的檢證理論所產生的問題－所謂檢證的弔詭－我們回頭檢討邏輯的條件語句，發現符號邏輯裏條件關係的真值表並不是如我們所素以為的那樣理所當然。由於條件語句事實上是一切邏輯語句中最切合實用的語句，因此在面對像建構一套合理的檢證理論一類的實際問題時，越是充分運用邏輯，就越接近荒謬的結果－這一點，Hempel的檢證理論正提供我們最典型的例子。條件語句的問題在二値邏輯的系統無法獲得解決，因此我們必須進一步訴諸一套三值的邏輯系統，才能得到合理的條件語句眞值表，並且解決像「檢證的弔詭」一類的矛盾。

關鍵字

檢證 ； 等值 ； 條件關係 ； 非真值函數 ； 蘊含關係

並列摘要

From Hempel's Theroy of Verification there arises a problem, namely The Verification of Paradox. When we go back and review conditional sentences in logic, we find symbolic logic's conditional truth-table isn't really like we have thought and taken for granted till now. In fact, conditional sentences in logic are all suitably practical sentences. Because of this, when we face the problem of verifying practical questions of a theroy, the more we use logic the closer we get to absurd conclusions. In demonstrating this point, Hempels verification theroy supplies us with a classic example. Conditional sentences in two-valued logical systems are incapable of supplying solutions, consequently have to advance to a three-valued logical system, in order to secure a valid conditional sentence truth-table and solve the paradox of The Verification of the Paradox.

並列關鍵字

Confirm ； Equivalence ； Conditional ； Non-Truth-Functional ； Implication