The complete identities system of algebra U2 have been constructed in the paper. On the basis of the complete identities system an algorithm for constructing the perfect disjunctive normal form is developed
We include the basic normal forms for propositional formulas. They are negative normal form, disjunc...
Regular algebra is the algebra of regular expressions as induced by regular language identity. We us...
A class of algebras forms a variety if it is characterised by a collection of identities. There is a...
The methods of constructing normal forms in the class of algebras are considered. Formulas of algebr...
The class of universal algebras, which are defined under binary square matrices of order n is consid...
In discrete mathematics, minimizing Boolean functions in the class of disjunctive normal forms is on...
A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast ...
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a no...
International audienceUsual normalization by evaluation techniques have a strong relationship with c...
AbstractA classical while-program normal-form theorem is derived in demonic refinement algebra. In c...
A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin ...
Recently there has been a growing interest towards algebraic structures that are able to express for...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...
AbstractUsing an algebraic representation of closed β-normal forms in λ-calculus, the Böhm's theorem...
AbstractA class of algebras forms a variety if it is characterised by a collection of identities. Th...
We include the basic normal forms for propositional formulas. They are negative normal form, disjunc...
Regular algebra is the algebra of regular expressions as induced by regular language identity. We us...
A class of algebras forms a variety if it is characterised by a collection of identities. There is a...
The methods of constructing normal forms in the class of algebras are considered. Formulas of algebr...
The class of universal algebras, which are defined under binary square matrices of order n is consid...
In discrete mathematics, minimizing Boolean functions in the class of disjunctive normal forms is on...
A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast ...
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a no...
International audienceUsual normalization by evaluation techniques have a strong relationship with c...
AbstractA classical while-program normal-form theorem is derived in demonic refinement algebra. In c...
A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin ...
Recently there has been a growing interest towards algebraic structures that are able to express for...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...
AbstractUsing an algebraic representation of closed β-normal forms in λ-calculus, the Böhm's theorem...
AbstractA class of algebras forms a variety if it is characterised by a collection of identities. Th...
We include the basic normal forms for propositional formulas. They are negative normal form, disjunc...
Regular algebra is the algebra of regular expressions as induced by regular language identity. We us...
A class of algebras forms a variety if it is characterised by a collection of identities. There is a...
DOI
Add to ORKG