关于「东西方原典考辨:《荀子·正名》与《几何原本》第一卷」,《冲突多半是冗余》给出的定量结论是什么?
结论:《荀子·正名》的「同则同之,异则异之」与「单不足以喻则兼」,对应规则库里的合并、分开与加上适用范围;p71 显示兼名消除了全部 3 处虚假冲突,而只有按真实意思分组才能找全 53 对重复。荀子没有给出判定同异的细则,尤其没有处理同一个意思写了两个数值的情形。《几何原本》第一卷把全部命题建立在少数公设与公理上,开了最小原语集的先河;第五公设的独立性要靠模型才能确认,而希尔伯特补上了欧几里得默认的假定。p72 显示,9 条规则里 8 条单独看都冗余,却不能一起删;不可再删的基有 4、5、6 条三种大小。原典给了方向,现代数学给了方法。剩下的问题是落地:怎样把这些方法接进每个月的规则治理,又怎样检验本书的核心命题?最后一章给出流程与预注册方案。
数据口径:书中规则库与数值均为示意;全部计算由书中程序生成;本书属非个人化经营方法,不构成法律、合规或经营决策意见,规则的增删须由主事者人工放行。 第一章正面陈述并量化命题:一千条示意规则里,标红配对中真矛盾只占 0.0392,裁决后 971 条是冗余,只剩 18 条约束性规则;越界规则占一成时真矛盾比例也只有 0.2667,但无解指标已遍及全部。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 53
| rules 30, bare names 8, meanings 9, duplicate pairs 53 | |||||
| meanings with 2+ names (synonyms): 3; names with 2+ meanings (homonyms): 3 | |||||
| key | groups | flagged | spurious | real | dup pairs found |
| bare name | 8 | 4 | 3 | 1 | 31 of 53 |
| name + scope | 12 | 1 | 0 | 1 | 31 of 53 |
| true meaning | 9 | 1 | 0 | 1 | 53 of 53 |
查看完整验算程序
# Chapter 7. p71: "same then same, different then different" as keys
# Model: an illustrative library of 30 threshold rules, each written
# under a name, a scope and a value; the true meaning is known. The
# rules are grouped three ways: by the bare name (a single name), by
# name plus scope (a compound name), and by the true meaning. A group
# whose values differ is flagged; a flag is spurious when the values
# differ only because the group mixes meanings, and real when one
# meaning carries two values. A duplicate pair (same meaning, same
# value) is found only if both rules land in one group. Counts only;
# no randomness.
from collections import Counter
from itertools import combinations
LIB = [
("tap target", "any page", "tap", 44, 5),
("tap target", "purchase path", "tap_buy", 48, 3),
("touch area", "any page", "tap", 44, 2),
("follow-ups", "silent customer", "fu_silent", 2, 4),
("chasers", "silent customer", "fu_silent", 2, 2),
("follow-ups", "per quote", "fu_quote", 3, 1),
("reminders", "unpaid order", "pay_remind", 2, 2),
("reminders", "idle learner", "learn_remind", 2, 1),
("reminders", "abandoned cart", "cart_remind", 5, 1),
("quiet hours", "messages", "quiet", 21, 4),
("quiet hours", "messages", "quiet", 22, 1),
("silent hours", "messages", "quiet", 21, 1),
("pushes", "per week", "push_week", 4, 3),
]
rules = []
for name, scope, meaning, v, k in LIB:
rules += [(name, scope, meaning, v)] * k
def audit(keyf):
groups = {}
for r in rules:
groups.setdefault(keyf(r), []).append(r)
flagged = spurious = real = 0
for g in sorted(groups):
rs = groups[g]
if len({r[3] for r in rs}) > 1:
flagged += 1
by_m = {}
for r in rs:
by_m.setdefault(r[2], set()).add(r[3])
if any(len(vs) > 1 for vs in by_m.values()):
real += 1
else:
spurious += 1
dup_found = 0
for g in sorted(groups):
for a, b in combinations(groups[g], 2):
if a[2] == b[2] and a[3] == b[3]:
dup_found += 1
return len(groups), flagged, spurious, real, dup_found
dups = 0
for a, b in combinations(rules, 2):
if a[2] == b[2] and a[3] == b[3]:
dups += 1
names = Counter()
for name, scope, meaning, v, k in LIB:
names[(name, meaning)] += 0
per_meaning = Counter(m for (_, m) in names)
per_name = Counter(n for (n, _) in names)
print("rules %d, bare names %d, meanings %d, duplicate pairs %d"
% (len(rules), len(per_name), len(per_meaning), dups))
print("meanings with 2+ names (synonyms): %d; names with 2+ meanings"
" (homonyms): %d" % (len([m for m in per_meaning
if per_meaning[m] > 1]),
len([n for n in per_name if per_name[n] > 1])))
print("key groups flagged spurious real dup pairs found")
for label, f in (("bare name", lambda r: r[0]),
("name + scope", lambda r: (r[0], r[1])),
("true meaning", lambda r: r[2])):
g, fl, sp, re_, dp = audit(f)
print("%-13s %6d %7d %8d %4d %8d of %d"
% (label, g, fl, sp, re_, dp, dups))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《跨卷规则消解与公理归约、千条机器规则阈值冲突检测与最小原语集母典》第 7 章「东西方原典考辨:《荀子·正名》与《几何原本》第一卷」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-258 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026258,
author = {Fan, Yafu},
title = {Cross-Volume Rule Resolution and Axiom Reduction: Detecting Threshold Conflicts among a Thousand Machine Rules and Finding a Minimal Primitive Set},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}