关于「可证伪性与研究纲领:什么才算科学命题」,《可证伪性与可重复性危机》给出的定量结论是什么?
结论:第一种情形与多林讨论的历史案例相似:一个久经考验的理论(事先 0.90)加上一个不太可靠的辅助假设(事先 0.60)。预测失败后,理论的可信度只降到 0.783,辅助假设却从 0.60 跌到 0.130:责任主要落在辅助假设上,这是合理的。第二种情形反过来:一个年轻的理论(0.50)配上一个久经检验的辅助假设(0.95),失败后理论跌到 0.048。第三种情形说明,如果「理论为真而辅助假设出错」本身就很难造成这种失败,即使理论事先很可信(0.90),它也会跌到 0.067。所以杜恒—蒯因论题说的是逻辑上的不确定,而证据可以在不同部分之间作出相当明确的区分。
数据口径:本书不是医疗、心理或投资建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(14 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.048, 0.067, 0.130, 0.50, 0.60, 0.783
| case | P(T) before -> after | P(A) before -> after |
|---|---|---|
| well-tested theory, shaky auxiliary | 0.90 -> 0.783 | 0.60 -> 0.130 |
| young theory, well-tested auxiliary | 0.50 -> 0.048 | 0.95 -> 0.905 |
| old theory, but failure unlikely if T holds 0.90 -> 0.067 | 0.60 -> 0.560 | |
| patches | degenerating: P(system) | progressive: P(system) |
| 0 | 0.900 | 0.9000 |
| 1 | 0.818 | 0.9783 |
| 2 | 0.692 | 0.9956 |
| 3 | 0.529 | 0.9991 |
| 4 | 0.360 | 0.9998 |
| 5 | 0.220 | 1.0000 |
核心公式
\[\mathrm{cont}(h) = 1 - m(h), \qquad \mathrm{inf}(h) = \log_2 \frac{1}{m(h)} \text{ 比特}.\]
查看完整验算程序
# Duhem's problem in Bayesian form (the approach of Dorling 1979; the numbers are
# illustrative). A prediction E follows only from theory T TOGETHER WITH an auxiliary
# assumption A. E fails. Logic says only "not (T and A)"; how the blame is shared depends
# on the priors and on how likely the failure would be in each of the other three cases. T
# and A are independent a priori.
def after_failure(pT, pA, l_TnA, l_nTA, l_nTnA):
# l_xy = P(failure | x, y); P(failure | T, A) = 0 because T and A together entail E
TnA = pT * (1 - pA) * l_TnA
nTA = (1 - pT) * pA * l_nTA
nTnA = (1 - pT) * (1 - pA) * l_nTnA
z = TnA + nTA + nTnA
return TnA / z, nTA / z # P(T | failure), P(A | failure)
cases = [
("well-tested theory, shaky auxiliary", 0.90, 0.60, 0.50, 0.50, 0.50),
("young theory, well-tested auxiliary", 0.50, 0.95, 0.50, 0.50, 0.50),
("old theory, but failure unlikely if T holds", 0.90, 0.60, 0.01, 0.50, 0.50),
]
print("case P(T) before -> after"
" P(A) before -> after")
for label, pT, pA, *l in cases:
T, A = after_failure(pT, pA, *l)
print(f"{label:43s} {pT:.2f} -> {T:.3f} {pA:.2f} -> {A:.3f}")
# Repeated rescue, as odds of the rescued system against a rival (prior odds 9 : 1). Every
# new auxiliary costs a factor 0.5 in prior odds. A DEGENERATING patch only explains the
# failure it was made for (the rival explains it too: likelihood ratio 1). A PROGRESSIVE
# patch also predicts a new fact that is then observed and that the rival gave only a 10 %
# chance (likelihood ratio 10).
print("patches degenerating: P(system) progressive: P(system)")
for k in range(6):
deg, prog = 9 * 0.5 ** k, 9 * (0.5 * 10) ** k
print(f"{k:7d} {deg / (1 + deg):22.3f} {prog / (1 + prog):21.4f}")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《科学方法论、可证伪性与可重复性危机的数理统计》第 1 章「可证伪性与研究纲领:什么才算科学命题」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23782104
DOI: 10.5281/zenodo.23782104 · 阅读本章所在专著 · 5DL-B-033 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026033,
author = {Fan, Yafu},
title = {Scientific Methodology, Falsifiability and the Mathematical Statistics of the Replication Crisis},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23782104},
url = {https://doi.org/10.5281/zenodo.23782104}
}