科研速览 · Science Skim继续刷下去 · Keep skimming →
◆ Philosophia Mathematica2026-01-08· Assertion

The Modal Logic of Arithmetic Potentialism and the Universal Algorithm

Joel David Hamkins

原始摘要(英文原文)· Original abstract
Abstract I investigate the modal commitments of the various conceptions of arithmetic potentialism that arise from the models of arithmetic by taking them as realms of feasibility with respect to their natural extension concepts, such as end extensions and arbitrary extensions, thereby shedding light on the range of differing philosophical positions available for arithmetic potentialism. The main analysis makes fundamental use of the universal algorithm, of which this article provides a simplified, self-contained account.
读原文 · Read the paper ↗

AI 追问PRO

登录后使用 AI 追问

讨论区

登录后参与讨论

相关论文 · Related

The Modal Logic of Arithmetic Potentialism and the Universal Algorithm — 科研速览 Science Skim