Set-theoretic analysis of nominative data
zbMATH Open1390.68196MaRDI QIDQ1650337FDOQ1650337
Authors: V. G. Skobelev, Ievgen Ivanov, M. S. Nikitchenko
Publication date: 3 July 2018
Published in: Computer Science Journal of Moldova (Search for Journal in Brave)
Full work available at URL: http://www.math.md/publications/csjm/issues/v23-n3/11976/
Recommendations
lattice theoryalgebraic systemclosed intervalsset theorylower semilatticelower and upper conesnominative datanominative set
Partial orders, general (06A06) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semilattices (06A12) General topics in the theory of data (68P01) Other classical set theory (including functions, relations, and set algebra) (03E20)
Cited In (5)
- Properties of semistructed data with multivalued naming and their use
- Classes of nominative data with fast access to components
- Nominative data with ordered set of names
- Basics of intensionalized data: presets, sets, and nominats
- On an algorithmic algebra over simple-named complex-valued nominative data
Uses Software
This page was built for publication: Set-theoretic analysis of nominative data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650337)