deMorgan(expression, prod.split = "", use.tilde = FALSE, complete = TRUE)
"qca"
.This function negates an boolean expression written in Disjunctive Normal Form.
In Boolean algebra, there are two transformation rules named after the British mathematician Augustus De Morgan. These rules state that:
1. The complement of the union of two sets is the intersection of their complements.
2. The complement of the intersection of two sets is the union of their complements.
In "normal" language, these would be written as:
1. "not (A and B)" = "(not A) or (not B)"
2. "not (A or B)" = "(not A) and (not B)"
Based on these two laws, any Boolean expression written in disjunctive normal form can be transformed into its negation.
It is also possible to negate all models and solutions from the result of a
Boolean minimization from function eqmcc()
. The resulting object, of
class "qca"
, is automatically recognised by this function (provided the
minimization is Boolean).
initial |
The initial expression. |
negated |
The negation of the initial expression. |
If x
is an object of type "qca"
, the result is a list of solutions.
Ragin, Charles C. 1987. The Comparative Method: Moving beyond Qualitative and Quantitative Strategies. Berkeley: University of California Press.
# example from Ragin (1987, p.99) deMorgan("AC + B~C")S1: AC + B~C N1: ~A~B + ~AC + ~B~C# with different intersection operators deMorgan("AB*EF + ~CD*EF")S1: AB*EF + ~CD*EF N1: ~AB*CD + ~EF# using an object of class "qca" produced with eqmcc() data(LC) cLC <- eqmcc(LC, "SURV", include = "?") deMorgan(cLC)S1: DEV*STB N1: dev + stb# parsimonious solution pLC <- eqmcc(LC, "SURV", include = "?") deMorgan(pLC)S1: DEV*STB N1: dev + stb