| Display title | Conjunctive normal form |
| Default sort key | Conjunctive normal form |
| Page length (in bytes) | 30,139 |
| Namespace ID | 0 |
| Page ID | 2232425 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>JOpenQuest |
| Date of page creation | 15:20, 6 February 2024 |
| Latest editor | imported>JOpenQuest |
| Date of latest edit | 15:20, 6 February 2024 |
| Total number of edits | 2 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In Boolean logic, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of one or more clauses, where a clause is a disjunction of literals; otherwise put, it is a product of sums or an AND of ORs. As a canonical normal form, it is useful in automated theorem proving... |
