SPECIAL LEXICAL ITEMS IN THE DOMAIN AREA OF RECORDS ADMINISTRATION

The purpose of the article. The article deals with peculiarities of terms as components of a purport in the domain area of record administration as well as studying qualitative and quantitative composition of the term system in this domain. Methodology: in the article historical, logical, comparative and statistic methods are used in order to extract types of special vocabulary which belong to the record administration term system; to determine peculiarities of special lexical items, their communities and differences; to describe qualitative and quantitative composition of the term system as a whole. The scientific novelty of the study is as follows: this is the first time the analysis of qualitative and quantitative composition of terms which are functioning in the domain area of record administration was made in order to highlight specialties of creation of their system. Conclusions. Results of the research shows that terms (90,2 % from the total quantity of terminological units), nomens (1,8 %) and identifying names (0,4 %) are used in purports. They have a different degree of concretization of the denoted. In the term system of the domain area of record administration preterms (7,6 %) are also used. Types of special units are presented in different classes unevenly: there are terms at all levels of the system; nomens and identifying names – only on the main ones, which are related to the specific character of record mamnagement concepts; preterms are mainly used on the basic system levels, but were noticed on additional one as well. They can develop the system of terms in the context of the domain area of record administration due to adding to the sphere of work with documents elements of conceptual apparatuses of other sciences. Keywords: nomen, identifying name, preterm, term, terminoid, term system, domain area of records administration.

Semigroups of an inductive composition of terms

The set of all [Formula: see text]-ary terms of type [Formula: see text] together with a binary operation derived from a superposition [Formula: see text] forms various forms of semigroups. One may generalize such binary operation by deriving it from an inductive composition of terms and call it an inductive product. However, this operation is not associative on the same base set but it becomes associative when all elements of subterms of a fixed term used in an inductive product except itself are excluded from the base set. Hence, a semigroup is formed. In this paper, we mainly focus on the algebraic structures of this semigroup such as idempotent elements, elements associating with each type of regularity condition, and Green’s relations. The formulae of complexity of inducted terms are also under investigation.