Tucker, J., & Bergstra, J. A. (2025). For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability. Theoretical Computer Science, 1034, p. 115124. doi:10.1016/j.tcs.2025.115124
Chicago Style CitationTucker, John, and Jan A. Bergstra. "For Rational Numbers With Suppes-Ono Division, Equational Validity Is One-one Equivalent With Diophantine Unsolvability." Theoretical Computer Science 1034 (2025): 115124.
MLA CitationTucker, John, and Jan A. Bergstra. "For Rational Numbers With Suppes-Ono Division, Equational Validity Is One-one Equivalent With Diophantine Unsolvability." Theoretical Computer Science 1034 (2025): 115124.
Warning: These citations may not always be 100% accurate.