We include the basic normal forms for propositional formulas. They are negative normal form, disjunctive normal form, and conjunctive normal formal. All are available using a function or applying a theorem. See more details in the NormalForms module
Bibliography: leaves 140-143.It was shown by Jaakko Hintikka that every formula of first-order logic ...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...
AbstractAfter showing that every pseudo-Boolean function (i.e. real-valued function with binary vari...
We consider a class of formulas which consist of real functions a1,…,aN, their derivatives, and zero...
AbstractWe consider a class of formulas which consist of real functions a1,…,aN, their derivatives, ...
summary:In this paper, we deal with the disjunctive and conjunctive normal forms in the frame of pre...
The methods of constructing normal forms in the class of algebras are considered. Formulas of algebr...
Normal forms play an important role in computer science, for example in the areas of logic and datab...
AbstractA new normal form of Boolean functions based on the sum (mod 2), product and negation is pre...
The normal form in logic has been considered. Any propositional function, i.e. any finite logical ex...
First we give a grammatical (or equational) description of the set fM normal form j 0 ` M : Ag for ...
Inductive Logic Programming considers almost exclusively universally quantified theories. To add exp...
We present a coinductive definition of models for modal logics and show that it provides a homogeneo...
In logic, there are various normal forms for formulae; for example, disjunctive and conjunctive norm...
In this paper we are concerned with the simplest normal form computation of the system
Bibliography: leaves 140-143.It was shown by Jaakko Hintikka that every formula of first-order logic ...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...
AbstractAfter showing that every pseudo-Boolean function (i.e. real-valued function with binary vari...
We consider a class of formulas which consist of real functions a1,…,aN, their derivatives, and zero...
AbstractWe consider a class of formulas which consist of real functions a1,…,aN, their derivatives, ...
summary:In this paper, we deal with the disjunctive and conjunctive normal forms in the frame of pre...
The methods of constructing normal forms in the class of algebras are considered. Formulas of algebr...
Normal forms play an important role in computer science, for example in the areas of logic and datab...
AbstractA new normal form of Boolean functions based on the sum (mod 2), product and negation is pre...
The normal form in logic has been considered. Any propositional function, i.e. any finite logical ex...
First we give a grammatical (or equational) description of the set fM normal form j 0 ` M : Ag for ...
Inductive Logic Programming considers almost exclusively universally quantified theories. To add exp...
We present a coinductive definition of models for modal logics and show that it provides a homogeneo...
In logic, there are various normal forms for formulae; for example, disjunctive and conjunctive norm...
In this paper we are concerned with the simplest normal form computation of the system
Bibliography: leaves 140-143.It was shown by Jaakko Hintikka that every formula of first-order logic ...
The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all...
AbstractAfter showing that every pseudo-Boolean function (i.e. real-valued function with binary vari...
DOI
Add to ORKG