This question already has an answer here:

I'm looking for an axiomatization of the natural numbers similar to ZFC or the standard axiomatization of set theory in the language of the first order predicate calculus such that the axiomatization only has one unique model of countable cardinality. I want one that excludes the nonstandard models of the natural numbers. Can anyone cite a reference?


marked as duplicate by Asaf Karagila set-theory Apr 26 at 13:00

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

  • 1
    $\begingroup$ That's impossible! By the Löwenheim-Skolem Theorem every theory that has an infinite model, has models in all infinite cardinalities. So in particular it has two non-isomorphic models. $\endgroup$ – Achilles Apr 26 at 12:39
  • $\begingroup$ Thanks for your response. I updated the question to ask about countable models only. Also, does Lowenheim Skolem apply to higher order languages as well? $\endgroup$ – David Warren Katz Apr 26 at 12:41
  • 2
    $\begingroup$ It doesn't. For example, second order arithmetic has only one model (up to isomorphism). $\endgroup$ – mihaild Apr 26 at 12:55

Browse other questions tagged or ask your own question.