A functional completeness theorem for De Morgan functions

Authors:
Yu. M. Movsisyan;V. A. Aslanyan
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 7
Cited 0

Universal Algebra, Algebraic Logic, and Databases

Universal Algebra, Algebraic Logic, and Databases
Universal Algebra and Applications in Theoretical Computer Science

Universal Algebra and Applications in Theoretical Computer Science
De Morgan Algebras - completeness and recursion

MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
De Morgan Bisemilattices

ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic
Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics)

Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics)
Boolean Functions

Boolean Functions
Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we define disjunctive and conjunctive normal forms of De Morgan functions and prove a functional completeness theorem for these functions.