Texonom
Texonom
/
Logic
Logic
/Logic Field/Boolean Algebra/
Conjunctive Normal Form
Search

Conjunctive Normal Form

Creator
Creator
Seonglae Cho
Created
Created
2023 Dec 5 6:18
Editor
Editor
Seonglae Cho
Edited
Edited
2023 Dec 19 1:26
Refs
Refs

CNF

 
 
 
 
 
 
Conjunctive normal form
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 and circuit theory.
Conjunctive normal form
https://en.wikipedia.org/wiki/Conjunctive_normal_form
List of logic symbols
In logic, a set of symbols is commonly used to express logical representation. The following table lists many common symbols, together with their name, how they should be read out loud, and the related field of mathematics. Additionally, the subsequent columns contains an informal explanation, a short example, the Unicode location, the name for use in HTML documents,[1] and the LaTeX symbol.
List of logic symbols
https://en.wikipedia.org/wiki/List_of_logic_symbols
 
 

Recommendations

Texonom
Texonom
/
Logic
Logic
/Logic Field/Boolean Algebra/
Conjunctive Normal Form
Copyright Seonglae Cho