References for Disjunctive normal form

Back to article

References to other articles, organized by section

Automated theorem proving
Boolean logic
Canonical normal form
Normal form (abstract rewriting)
Philosophical logic
Sum of products

Definition

Conjunctive normal form
Context-free grammar
Literal (mathematical logic)
Logical conjunction
Logical disjunction
Negation
Propositional variable

Conversion to DNF

Classical logic
Karnaugh map

... by syntactic means

Abstract rewriting system
De Morgan's laws
Distributive property
Double negation elimination
Functional completeness
Logical equivalence

... by semantic means

Truth table

Disjunctive Normal Form Theorem

Alphabetical order
Contradiction
Functional completeness
Logical conjunction
Logical disjunction
Metalogic
Propositional calculus
Triviality (mathematics)
Truth table

Maximum number of conjunctions

Tautology (logic)

Computational complexity

Boolean satisfiability problem
Co-NP-hard
Conjunctive normal form
Duality principle (Boolean algebra)
NP-completeness
P (complexity)
Tautology (logic)

Variants

Analysis of algorithms

Source on Wikipedia (https://en.wikipedia.org)

--

Gemipedia Home
Go to Article
Using English Wikipedia. Change Language?

--
Size: 3.1 KB. 98.13% smaller than original: 166.14 KB 🤮
Fetched: 18 ms. Converted: 466 ms. 🐇

Made with 📚 and ❤️ by Acidus (mailto://)

All Wikipedia content is licensed under CC BY-SA 3.0