# Section 3.2: Problem 2 Solution

Working problems is a crucial part of learning mathematics. No one can learn... merely by poring over the definitions, theorems, and examples that are worked out in the text. One must work part of it out for oneself. To provide that opportunity is the purpose of the exercises.
James R. Munkres
Show that in the structure $(\mathbb{N};+)$ the following relations are definable:
(a) Ordering, $\{m,n|m .
(b) Zero, $\{0\}$ .
(c) Successor, $\{m,n|n=S(m)\}$ .
This exercise shows that the theory of $(\mathbb{N};+)$ is, in fact, coincides with the theory of $\mathfrak{N}_{A}=(\mathbb{N};0,S,<,+)$ .
(a) $\exists x(x+x\neq x\wedge v_{1}+x=v_{2})$ .
(b) $v_{1}+v_{1}=v_{1}$ .
(c) $\exists x(x+x\neq x\wedge\forall y\forall z(y+y\neq y\rightarrow z+z\neq z\rightarrow y+z\neq x)\wedge v_{1}+x=v_{2})$ .
{"found_math": true, "script_math_tex": 9, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://dbfin.com/logic/enderton/chapter-3/section-3-2-other-reducts-of-number-theory/problem-2-solution/", "fetch_time": 1618350527000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-17/segments/1618038075074.29/warc/CC-MAIN-20210413213655-20210414003655-00074.warc.gz", "warc_record_offset": 315196987, "warc_record_length": 5219, "token_count": 284, "char_count": 832, "score": 3.5, "int_score": 4, "crawl": "CC-MAIN-2021-17", "snapshot_type": "latest", "language": "en", "language_score": 0.79173344373703, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00044-of-00064.parquet"}