Criteria of functional completeness for meta-algebras without assignments of logical constants

DOI10.1007/BF02733423zbMath0952.68158OpenAlexW2089620906WikidataQ124801304 ScholiaQ124801304MaRDI QIDQ1974307

G. E. Tseitlin

Publication date: 7 May 2000

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

Full work available at URL: https://doi.org/10.1007/bf02733423

zbMATH Keywords

functional completenessmeta-algebras

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Issues of algorithmics and Glushkov's systems of algorithmic algebras
• Functional completeness criteria in Dijkstra algebra
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Unnamed Item
• Unnamed Item