Having just read Noah Schweber's excellent answer to this question, I am reminded of something that has always mystified me. I was taught that the Peano Postulates are categorical (that is, any two models are isomorphic,) a fact which seems intuitively obvious. So, how can there be nonstandard models? In particular if I have some uncountable nonstandard model of PA, why can't I pick some element $s$, and consider the elements$$s, s+s, s+s+s, ...$$ to get a countable model inside the given model, just as I would construct the even positive integers inside the natural numbers by taking $s=2$? Surely the uncountable model and the countable model aren't isomorphic, are they?
I understand how the compactness theorem shows the existence of nonstandard models, and I have no problem with that. I just don't understand how to reconcile this with categoricity.
There are two different versions of "Peano arithmetic": a first-order version and a second-order version. The second-order version has as its induction axiom the statement that for any subset $S$ of the structure, if $0\in S$ and $x+1\in S$ for all $x\in S$, then $S$ is the entire structure. The first-order version has a much weaker induction axiom: it only applies to subsets $S$ which are definable in first-order logic (that is, subsets which can be described as the set of elements of the structure which make some first-order formula true). The first-order version is generally far more interesting from the perspective of logic and is what "Peano arithmetic" normally refers to, since it can be formulated as a first-order theory.
The second-order version of Peano arithmetic is categorical, but the first-order version is not. The answer you linked to is talking about the first-order version, not the second-order version.