Theorem

Let be the set of all sentences true in the standard model of arithmetic, Then there are models containing an element such that are all true in .

Remark

Because cannot be reached from in a finite number of steps, it is an infinite element. Any model containing such an element is “non-standard” because its domain is strictly larger and structured differently than .

Dense Linear Orderings

A linear ordering is dense if has no endpoints if

End Extension

We say that is an end extension of , denoted as , if and only if the following two conditions hold:

  1. is a submodel of , meaning , and the interpretations of all constants, functions, and relations in agree with those in when restricted to .
  2. Any element in that is strictly less than an element in must already belong to . In other words, forms an initial segment of with respect to the ordering .

Alternatively, this second condition can be stated in its contrapositive form, which directly describes the “new” elements: All new elements added to the extension are strictly greater than every element in the original model .

Isomorphic Orderings

Two (linear) orderings and are isomorphic, written , if there exists a bijection such that iff .

Theorem

Suppose and are countable dense linear orders without end points. Then they are isomorphic.