Changes

Line 4,565: Line 4,565:  
In this setting the <math>^{\backprime\backprime}\!\!<\!^{\prime\prime}</math> on the left is a logical ordering on syntactic terms while the <math>^{\backprime\backprime}\!\!<\!^{\prime\prime}</math> on the right is an arithmetic ordering on real numbers.
 
In this setting the <math>^{\backprime\backprime}\!\!<\!^{\prime\prime}</math> on the left is a logical ordering on syntactic terms while the <math>^{\backprime\backprime}\!\!<\!^{\prime\prime}</math> on the right is an arithmetic ordering on real numbers.
   −
The type of principle that comes up here is usually discussed under the question of whether a map between two ordered sets is ''order-preserving'' or notThe general type of question may be formalized in the following way.
+
The question that arises in this case is whether a map between two ordered sets is ''order-preserving''.  In order to formulate the question in more general terms, we may begin with the following set-up:
   −
: Let ''X''<sub>1</sub> be a set with an ordering denoted by "&lt;<sub>1</sub>".
+
{| align="center" cellspacing="6" width="90%"
 +
| Let <math>X_1\!</math> be a set with the ordering <math><_1\!.</math>
 +
|-
 +
| Let <math>X_2\!</math> be a set with the ordering <math><_2\!.</math>
 +
|}
   −
: Let ''X''<sub>2</sub> be a set with an ordering denoted by "&lt;<sub>2</sub>".
+
An order relation is typically defined by a set of axioms that determines its properties.  Since we have frequent occasion to view the same set in the light of several different order relations, we often resort to explicit specifications like <math>(X, <_1),\!</math> <math>(X, <_2),\!</math> and so on, to indicate a set with a given ordering.
 
  −
What makes an ordering what it is will commonly be a set of axioms that defines the properties of the order relation in question.  Since one frequently has occasion to view the same set in the light of several different order relations, one will often resort to explicit forms like (''X'',&nbsp;&lt;<sub>1</sub>), (''X'',&nbsp;&lt;<sub>2</sub>), and so on, to invoke a set with a given ordering.
      
A map ''F'' : (''X''<sub>1</sub>,&nbsp;&lt;<sub>1</sub>) &rarr; (''X''<sub>2</sub>,&nbsp;&lt;<sub>2</sub>) is ''order-preserving'' if and only if a statement of a particular form holds for all ''x'' and ''y'' in (''X''<sub>1</sub>,&nbsp;&lt;<sub>1</sub>), specifically, this:
 
A map ''F'' : (''X''<sub>1</sub>,&nbsp;&lt;<sub>1</sub>) &rarr; (''X''<sub>2</sub>,&nbsp;&lt;<sub>2</sub>) is ''order-preserving'' if and only if a statement of a particular form holds for all ''x'' and ''y'' in (''X''<sub>1</sub>,&nbsp;&lt;<sub>1</sub>), specifically, this:
12,080

edits