[CG] Re: Peirce's 1870 “Logic of Relatives”

Cf: Peirce’s 1870 “Logic of Relatives” • Comment 11.18 Peirce’s 1870 “Logic of Relatives” • Comment 11.18 https://oeis.org/wiki/Peirce%27s_1870_Logic_Of_Relatives_%E2%80%A2_Part_2#C… All, An “order-preserving map” is a special case of a structure-preserving map and the idea of preserving structure, as used in mathematics, means preserving some but not necessarily all the structure of the source domain in the transition to the target domain. In that vein, we may speak of “structure preservation in measure”, the suggestion being that a property able to be qualified in manner is potentially able to be quantified in degree, admitting answers to questions like, “How structure-preserving is it?” Let’s see how this applies to Peirce’s “number of” function v : S → R. Let “—<” denote the implication relation on logical terms, let “≤” denote the less than or equal to relation on real numbers, and let x, y be any pair of absolute terms in the syntactic domain S. Then we observe the following relationships. • x —< y ⇒ v(x) ≤ v(y) Equivalently: • x —< y ⇒ [x] ≤ [y] Nowhere near the number of logical distinctions on the left sides of the implication arrows are typically preserved as one passes to the linear orderings of real numbers on their right sides but that is not required in order to call the map v : S → R order-preserving, or what is known as an “order morphism”. Regards, Jon