Boolos的最难逻辑谜题至少需要三个可接受问题才能解决:公理化框架与严格证明
Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof
AI总结:
本文为Boolos的最难逻辑谜题构建公理化框架,引入“可接受问题”概念,严格证明其至少需三个是非问题才能确定性求解,并计算了相关概率。
摘要:
本文提出了Boolos的最难逻辑谜题的形式化公理数学框架,并证明了关于其可解性的两个定理。通过严格遵循Boolos的指示(特别是所有神明始终有义务回答的要求),引入了该谜题的“可接受问题”这一新概念。随后严格证明,Boolos的原始谜题可以以绝对确定性的方式,在不少于三个是非可接受问题内得到解决。然而,这并不意味着仅凭纯粹的运气就能用少于三个可接受问题解决它。因此,本文也计算了这些概率。
英文摘要:
A formal axiomatic mathematical framework for Boolos' Hardest Logic Puzzle Ever is presented and two theorems about its solvability are proved. By strictly following Boolos' instructions (in particular, the requirement that all gods are always obliged to answer), the novel concept of \textit{admissible questions} for the puzzle is introduced. It is then rigorously proved that Boolos' original puzzle can be solved, in an absolute deterministic way, in no less than three yes-no admissible questions. However, this does not mean that one could solve it in less than three admissible questions by just pure \emph{chance}. Hence, such probabilities are computed here as well.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。