Open AccessON 1-INDISCERNIBILITY OF E-COMBINATIONS OF ORDERED THEORIES
Author(s) -
S. V. Sudoplatov
Publication year - 2021
Publication title -
ķazaķstan-britan tehnikalyķ universitetìnìņ habaršysy
Language(s) - English
Resource type - Journals
eISSN - 2959-8109
pISSN - 1998-6688
DOI - 10.55452/1998-6688-2021-18-4-26-31
Subject(s) - unary operation , predicate (mathematical logic) , mathematics , equivalence (formal languages) , class (philosophy) , omega , pure mathematics , categorical variable , discrete mathematics , computer science , physics , artificial intelligence , quantum mechanics , statistics , programming language
In this paper, we investigate properties that are preserved or acquired when combining an arbitrary number of theories or structures. Recently, an interest has been shown in the study of P-combinations (when each structure is distinguished by a separate unary predicate) and E-combinations (when each structure is distinguished by a separate class of equivalence with respect to E). Here we studied the properties of E-combinations of linearly ordered theories. The 1-indiscernibilty and density of a weakly o-minimal E-combination of countably many copies of an almost omega-categorical weakly o-minimal theory in a language that does not contain distinguished constants are established.