| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 922 2 |
| Ultima descărcare din IBN: 2017-04-26 12:58 |
| Căutarea după subiecte similare conform CZU |
| [512.54+519.7]:004.42.021 (1) |
| Algebră (400) |
| Cibernetică matematică (93) |
| Programe. Software (295) |
 SM ISO690:2012SKOBELEV, Volodymyr, IVANOV, Ievgen, NIKITCHENKO, Mykola. Set-theoretic Analysis of Nominative Data. In: Computer Science Journal of Moldova, 2015, nr. 3(69), pp. 270-288. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 3(69) / 2015 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: [512.54+519.7]:004.42.021 | ||||||
| Pag. 270-288 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In the paper we investigate the notion of nominative data that can be considered as a general mathematical model of data used in computing systems. The main attention is paid to flat nominative data called nominative sets. The structure of the partially-ordered set of nominative sets is investigated in terms of set theory, lattice theory, and algebraic systems theory. To achieve this aim the correct transferring of basic set-theoretic op- erations to nominative sets is proposed. We investigate a lower semilattice of nominative sets in terms of lower and upper cones, closed and maximal closed intervals of nominative sets. The ob- tained results can be used in formal software development. |
||||||
| Cuvinte-cheie nominative set, nominative data, Set theory, lattice theory, lower semilattice, lower and upper cones, closed intervals, Algebraic system |
||||||
|
|
|
|
