arXiv:2605.05016 · v2
Goedel Logics: On the Elimination of The Absoluteness Operator
摘要
We investigate the eliminability of the absoluteness operator Delta in Goedel logics. While Delta is not definable from the standard connectives and disrupts important proof-theoretic properties, we show that it becomes eliminable at the propositional level under a non-standard semantics in which all propositional atoms (except the truth constant 'True') are interpreted strictly below 1. Under this semantics, every formula containing Delta is equivalent to a disjunction of chain formulas, yielding a Delta-free normal form (standard and non-standard semantics coincide w.r.t. valid formulas without Delta). We further analyze the situation in the first-order setting, where Delta-elimination fails in general due to recursion-theoretic and topological constraints, but can be recovered under witnessed semantics.
作者备注：This research was funded in part by the Austrian Science Fund (FWF) 10.55776/P36571. To be appeared in TbiLLC 2025 Postproceedings