View source for Abstraction by identification

A manner of forming general abstract concepts in which, when considering concrete initial objects, only those differences are considered that, for any reason, are relevant to the given situation, while other differences that are regarded as irrelevant are ignored. Initial objects differing from one another only in irrelevant aspects are considered as identical. Linguistically, abstraction by identification is manifested by the fact that two similar initial objects are identified with each other, and are spoken of as a single object, after having been assigned some suitable term. For instance, by identifying similar letters (words, alphabets) with each other, one arrives at the concept of an abstract [[Letter|letter]], [[Word|word]] or [[Alphabet|alphabet]] (see [[#References|[1]]]); by identifying equivalent fundamental sequences of rational numbers one arrives at the concept of real numbers (cf. [[Real number|Real number]]); by identifying isomorphic groups with each other, one arrives at the concept of an abstract group, etc.

See also [[Abstraction, mathematical|Abstraction, mathematical]]; [[Equivalence|Equivalence]]; [[Isomorphism|Isomorphism]].

====References====
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  A.A. Markov,   "Theory of algorithms" , Israel Program Sci. Transl.  (1961)  (Translated from Russian)  (Also: Trudy Mat. Inst. Steklov. 42 (1954))</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top">  A.A. Markov,   "On the logic of constructive mathematics" , Moscow  (1972)  (In Russian)</TD></TR></table>