Recursive Structures For PA
A structure in the language of PA is recursive if there are recursive functions + and × from to, a recursive two-place relation < on, and distinguished constants such that
where indicates isomorphism and is the set of (standard) natural numbers. Because the isomorphism must be a bijection, every recursive model is countable. There are many nonisomorphic countable nonstandard models of PA.
Read more about this topic: Tennenbaum's Theorem
Famous quotes containing the word structures:
“The philosopher believes that the value of his philosophy lies in its totality, in its structure: posterity discovers it in the stones with which he built and with which other structures are subsequently built that are frequently better—and so, in the fact that that structure can be demolished and yet still possess value as material.”
—Friedrich Nietzsche (1844–1900)