Definition:Singular Conjunction
From ProofWiki
Definition
Let $\Bbb B = \left\{{T, F}\right\}$ be a boolean domain.
A singular conjunction in the set of propositions of type $\Bbb B^k \to \Bbb B$ is a conjunction of $k$ literals that includes just one conjunct of each complementary pair $\left\{{x_j, \neg x_j}\right\}$ for each $j: 1 \le j \le k$.
The above is a little obscure and needs to be clarified.
You can help ProofWiki by explaining it.
To discuss this point in more detail, feel free to use the talk page.
If you are able to explain it, then when you have done so you can remove this instance of {{Explain}} from the code.
If you would welcome a second opinion as to whether your explanation is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
A singular proposition $s : \mathbb B^k \to \mathbb B$ can be expressed as a singular conjunction:
- $s = e_1 \land e_2 \land \ldots \land e_{k-1} \land e_k$
where:
- $\forall j \in \left[{1\,.\,.\,k}\right]: e_j \in \left\{{x_j, \neg x_j}\right\}$
