Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909789227843584 |
|---|---|
| author | Colomina-Almiñana, J. J. Stinga, P. R. |
| author_facet | Colomina-Almiñana, J. J. Stinga, P. R. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1804_05677 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof Colomina-Almiñana, J. J. Stinga, P. R. History and Overview 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. |
| title | Boolos' Hardest Logic Puzzle Ever can be solved in no less than three admissible questions: axiomatic framework and rigorous proof |
| topic | History and Overview |
| url | https://arxiv.org/abs/1804.05677 |