For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability

Open Access
Authors
Publication date 22-04-2025
Journal Theoretical Computer Science
Article number 115124
Volume | Issue number 1034
Number of pages 7
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract

Adding division to rings and fields leads to the question of how to deal with division by 0. From a plurality of options, we discuss in detail what we call Suppes-Ono division in which division by 0 produces 0. We explain the backstory of this semantic option and its associated notion of equality, and prove a result regarding the logical complexity of deciding equations over the rational numbers equipped with Suppes-Ono division. We prove that deciding the validity of the equations is computationally equivalent to the Diophantine Problem for the rational numbers, which is a longstanding open problem.

Document type Article
Language English
Published at https://doi.org/10.1016/j.tcs.2025.115124
Other links https://www.scopus.com/pages/publications/85217902761
Downloads
1-s2.0-S0304397525000623-main (Final published version)
Permalink to this page
Back