Boolos最难逻辑谜题至少需三个可容许问题方可求解：公理框架与严格证明
历史与综述
2025-09-17 v3
摘要
给出了Boolos最难逻辑谜题的形式化公理数学框架，并证明了关于其可解性的两个定理。通过严格遵循Boolos的指示（特别是所有神总是必须回答的要求），引入了该谜题的\textit{可容许问题}这一新概念。随后严格证明：Boolos原谜题可以以绝对确定性的方式，用不少于三个是非型可容许问题求解。然而，这并不意味着仅凭纯\emph{偶然}就能用少于三个可容许问题求解。因此，本文也计算了此类概率。
引用
@article{arxiv.1804.05677,
title = {Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof},
author = {J. J. Colomina-Almiñana and P. R. Stinga},
journal= {arXiv preprint arXiv:1804.05677},
year = {2025}
}
备注
13 pages, revised version, new title. The results were first presented as an Invited Colloquium in Philosophy of Logic at the American Philosophical Association Pacific Division Meeting in San Diego in March 2018. To appear in Logique et Analyse