Implicit commitment in a general setting.
Saved in:
| Title: | Implicit commitment in a general setting. |
|---|---|
| Authors: | ŁeŁyk, Mateusz1 (AUTHOR), Nicolai, Carlo2 (AUTHOR) |
| Source: | Journal of Logic & Computation. Sep2024, Vol. 34 Issue 6, p1136-1158. 23p. |
| Subjects: | Incompleteness theorems, Philosophy of mathematics, Logic programming, Open-ended questions, Motivation (Psychology) |
| Abstract: | Gödel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit those implicit assumptions. This notion of implicit commitment motivates directly or indirectly several research programmes in logic and the foundations of mathematics; yet there hasn't been a direct logical analysis of the notion of implicit commitment itself. In a recent paper, we carried out an initial assessment of this project by studying necessary conditions for implicit commitments; from seemingly weak assumptions on implicit commitments of an arithmetical system |$S$| , it can be derived that a uniform reflection principle for |$S$| —stating that all numerical instances of theorems of |$S$| are true—must be contained in |$S$| 's implicit commitments. This study gave rise to unexplored research avenues and open questions. This paper addresses the main ones. We generalize this basic framework for implicit commitments along two dimensions: in terms of iterations of the basic implicit commitment operator, and via a study of implicit commitments of theories in arbitrary first-order languages, not only couched in an arithmetical language. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Gödel's Incompleteness Theorems suggest that no single formal system can capture the entirety of one's mathematical beliefs, while pointing at a hierarchy of systems of increasing logical strength that make progressively more explicit those implicit assumptions. This notion of implicit commitment motivates directly or indirectly several research programmes in logic and the foundations of mathematics; yet there hasn't been a direct logical analysis of the notion of implicit commitment itself. In a recent paper, we carried out an initial assessment of this project by studying necessary conditions for implicit commitments; from seemingly weak assumptions on implicit commitments of an arithmetical system |$S$| , it can be derived that a uniform reflection principle for |$S$| —stating that all numerical instances of theorems of |$S$| are true—must be contained in |$S$| 's implicit commitments. This study gave rise to unexplored research avenues and open questions. This paper addresses the main ones. We generalize this basic framework for implicit commitments along two dimensions: in terms of iterations of the basic implicit commitment operator, and via a study of implicit commitments of theories in arbitrary first-order languages, not only couched in an arithmetical language. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 0955792X |
| DOI: | 10.1093/logcom/exad025 |
