Tucker, J., & Bergstra, J. A. (2025). A Complete Finite Axiomatisation of the Equational Theory of Common Meadows. ACM Transactions on Computational Logic, 26(1), pp. 1-28. doi:10.1145/3689211
Chicago Style CitationTucker, John, and Jan A. Bergstra. "A Complete Finite Axiomatisation of the Equational Theory of Common Meadows." ACM Transactions On Computational Logic 26, no. 1 (2025): 1-28.
MLA CitationTucker, John, and Jan A. Bergstra. "A Complete Finite Axiomatisation of the Equational Theory of Common Meadows." ACM Transactions On Computational Logic 26.1 (2025): 1-28.
Warning: These citations may not always be 100% accurate.