Functional completeness criteria in Dijkstra algebra

DOI10.1007/BF02366313zbMath0854.68063MaRDI QIDQ1922339

Yanyan Li

Publication date: 27 October 1996

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

zbMATH Keywords

algorithmsDijkstra algebraalgebras of algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items (4)

Criteria of functional completeness for meta-algebras without assignments of logical constants ⋮ Constructing the lattice of subalgebras of the Dijkstra algebra ⋮ Functional completeness in iterative meta-algebras ⋮ Issues of algorithmics and Glushkov's systems of algorithmic algebras

Cites Work

• Algebra of algorithms and Kaluzhnin's graph-schemas
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Functional completeness criteria in Dijkstra algebra