关于「自我归属增益:自行推出的结论在反驳下的保持率」,《前提植入与零阻抗说服》给出的定量结论是什么?

结论:第六章模拟自行推出的结论在反驳下的保持率,交叉点在 2.058 轮,并给出复述率的测量办法。

数据口径:核对原文以后,本书写下蓝图修正:O'Keefe 的元分析汇总 13,754 名被试,明示结论平均更有说服力,平均相关 0.110;省略结论只在高卷入、听者有能力自行推出时占优;书名里的「零阻抗」不是可证事实,只能写成逆反分量的上下界与模拟分位数。 书中参数为示意或合成数据,全部计算由书中程序生成。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 2.058

rounds told self self - told
00.6000 0.4500 -0.1500
10.4800 0.4140 -0.0660
20.3840 0.3809 -0.0031
30.3072 0.3504 +0.0432
40.2458 0.3224 +0.0766
50.1966 0.2966 +0.1000
crossover at n*2.058 rounds
Poisson LAM told self reversal told reversal self
0.50.5429 0.4324 0.0952 0.0392
1.00.4912 0.4154 0.1813 0.0769
2.00.4022 0.3835 0.3297 0.1479
4.00.2696 0.3268 0.5507 0.2739
simulated self-derived share at LAM 20.3829
Poisson crossover at LAM*2.397
查看完整验算程序
# Chapter 6. p61: told vs self-derived conclusions under counterargument
# Told: initial acceptance A_T = 0.60, kept through each counterargument
# with R_T = 0.80. Self-derived: A_S = 0.45 (fewer readers get there),
# kept with R_S = 0.92 (direction from Janis and King 1954 and the
# generation effect; sizes illustrative). Fixed n rounds: A * R^n.
# Crossover n* = ln(A_T / A_S) / ln(R_S / R_T). With Poisson(LAM) rounds
# the expected share still holding is A * exp(-LAM * (1 - R)); a seeded
# simulation cross-checks one case.
import math
import random

A_T, R_T = 0.60, 0.80
A_S, R_S = 0.45, 0.92

print("rounds  told    self    self - told")
for n in range(0, 6):
    t, s = A_T * R_T ** n, A_S * R_S ** n
    print("{:>6}  {:.4f}  {:.4f}  {:+.4f}".format(n, t, s, s - t))
n_star = math.log(A_T / A_S) / math.log(R_S / R_T)
print("crossover at n* = {:.3f} rounds".format(n_star))
print("Poisson LAM  told    self    reversal told  reversal self")
for lam in (0.5, 1.0, 2.0, 4.0):
    kt = math.exp(-lam * (1 - R_T))
    ks = math.exp(-lam * (1 - R_S))
    print("{:>11.1f}  {:.4f}  {:.4f}  {:>13.4f}  {:>13.4f}".format(
        lam, A_T * kt, A_S * ks, 1 - kt, 1 - ks))
rng = random.Random(38606)


def poisson(lam):
    k, p, lim = 0, 1.0, math.exp(-lam)
    while True:
        p *= rng.random()
        if p < lim:
            return k
        k += 1


held = []
for _ in range(100000):
    n = poisson(2.0)
    held.append(A_S if rng.random() < R_S ** n else 0.0)
print("simulated self-derived share at LAM 2: {:.4f}".format(
    math.fsum(held) / len(held)))
lam_star = math.log(A_T / A_S) / (R_S - R_T)
print("Poisson crossover at LAM* = {:.3f}".format(lam_star))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《推演中途前提植入、省略三段论自发归结与零阻抗顺势说服母典》第 6 章「自我归属增益:自行推出的结论在反驳下的保持率」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-386 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026386,
  author    = {Fan, Yafu},
  title     = {Mid-Stream Premise Seeding, Enthymematic Self-Derivation and Zero-Reactance Persuasion Along Reasoning Paths},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论