Functional completeness criteria in Dijkstra algebra
type: Item
instance of: scholarly article
title: Functional completeness criteria in Dijkstra algebra
zbMATH Open document ID: 0854.68063
DOI: 10.1007/BF02366313
author: Yanyan Li
published in: Cybernetics and Systems Analysis
publication date: 1996-10-27T00:00:00Z
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 921655
zbMATH Keywords: algorithms
zbMATH Keywords: Dijkstra algebra
zbMATH Keywords: algebras of algorithms
MaRDI profile type: Publication
cites work: Q5684216
cites work: Q4174249
cites work: Q4187313
cites work: Q4198053
cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
cites work: Algebra of algorithms and Kaluzhnin's graph-schemas
cites work: Q3256561
Recommended article: An assertion concerning functionally complete algebras and NP-completeness
Recommended article: Q3727865
Recommended article: A GENERALISATION OF SLUPECKI'S CRITERION FOR FUNCTIONAL COMPLETENESS
Recommended article: Q4326182
Recommended article: Functional completeness in iterative meta-algebras
Recommended article: Completeness criteria for a class of reducibilities
Recommended article: Q3704925
Recommended article: Functional completeness in pseudocomplemented De Morgan algebras
Recommended article: Q4007503
Recommended article: Q4263834
description: scientific article; zbMATH DE number 921655