Algebraic Backgrounds for Data Structures Models

EasyChair Preprint 1702

Abstract

The main aim of the Algebraic Aggregate Theory is to present uniformly data structures in mathematics and its applications in terms of Universal Algebra. In the given paper are characterized three sub-algebras of the Algebraic Aggregate Theory. These sub-algebras are the sub-algebra of ordered pairs, the successor sub-algebra and the algebra of Semi-Boolean Systems. Some applications of the obtained results for solving mathematical problems and software development are illustrated.

Keyphrases: Algebraic Aggregate Theory, Computer Science, Semi-Boolean systems, algebraic system, axiom system, data structure, data structures, non associative algebraic system, semi boolean

@booklet{EasyChair:1702,
  author    = {Volodymyr G. Skobelev},
  title     = {Algebraic Backgrounds for Data Structures Models},
  howpublished = {EasyChair Preprint 1702},
  year      = {EasyChair, 2019}}