Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics

DOI10.1007/s10559-007-0101-3zbMath1154.68545OpenAlexW2087188217MaRDI QIDQ941187

G. E. Tseitlin, L. M. Zakhariya, A. E. Doroshenko

Publication date: 4 September 2008

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-007-0101-3

zbMATH Keywords

functional completeness\(n\)-ary relationclones of algebrascodd's algebracomposition of \(n\)-relationsfunctionality of n-relationslattice of maximal subalgebras

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Theory of software (68N99)

Cites Work

• Algebras of hyperschemes and integrated tools for synthesis of programs in modern object-oriented environments
• Issues of algorithmics and Glushkov's systems of algorithmic algebras
• Glushkov algebras and clone theory
• A relational model of data for large shared data banks
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• The problem of functional completeness of metaalgebras of regular events
• Integrated tools for design and synthesis of classes of algorithms and programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formalization of algorithmic knowledge of object domains in terms of the algebra of algorithmics