Abstract
Redei in [53] shows that every congruence on ℕn is finitely generated. This result has since been known as Redei’s theorem, and it is equivalent to the fact that every finitely generated (commutative) monoid is finitely presented. Redei’s proof is long and elaborated. Many other authors have given alternative and much simpler proofs than his (see for instance [31, 39, 41, 56]). Since numerical semigroups are cancellative monoids, a different approach can be chosen to prove Redei’s theorem. And this is precisely the path we choose in this chapter.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
