Set-theoretic analysis of nominative data

MaRDI QIDQ1650337zbMATH OpenFDO

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)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL http://www.math.md/publications/csjm/issues/v23-n3/11976/

zbMATH Keywords

lattice theoryalgebraic systemclosed intervalsset theorylower semilatticelower and upper conesnominative datanominative set

Mathematics Subject Classification ID

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)

Recommendations

• Nominative data with ordered set of names
• Simple-named complex-valued nominative data -- definition and basic operations
• On an algorithmic algebra over simple-named complex-valued nominative data
• Nominal sets. Names and symmetry in computer science
• Nominal Sets over Algebraic Atoms

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

Describes a project that uses

Uses Software

• Easychair

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)