Abstract
Rédei in [53] shows that every congruence on ℕn is finitely generated. This result has since been known as Rédei’s theorem, and it is equivalent to the fact that every finitely generated (commutative) monoid is finitely presented. Rédei’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 Rédei’s theorem. And this is precisely the path we choose in this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Rosales, J., García-Sánchez, P. (2009). Presentations of a numerical semigroup. In: Numerical Semigroups. Developments in Mathematics, vol 20. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-0160-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0160-6_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-0159-0
Online ISBN: 978-1-4419-0160-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)