Functional completeness in iterative meta-algebras

DOI10.1007/BF02742065zbMath0917.03030WikidataQ124816500 ScholiaQ124816500MaRDI QIDQ1280934

G. E. Tsejtlin

Publication date: 5 May 1999

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

zbMATH Keywords

functional completenessstructured programmingmaximal subalgebrasalgebras of algorithmsDijkstra meta-algebragoto programmingiterative meta-algebrasloop constructs

Mathematics Subject Classification ID

Logic in computer science (03B70) Algebraic logic (03G99) General topics in the theory of software (68N01)

Cites Work

• Unnamed Item
• Unnamed Item
• Functional completeness criteria in Dijkstra algebra
• Universal algebras with all operations of bounded range
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: Functional completeness in iterative meta-algebras