Can I Determine if a Formula is a Tautology by Finding its CNF and DNF?

  • Context: MHB 
  • Thread starter Thread starter hossam killua
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on determining if a formula is a tautology by finding its Conjunctive Normal Form (CNF) and Disjunctive Normal Form (DNF). A participant confirms that the formula in question is indeed a tautology. The conversation highlights the importance of using $\LaTeX$ for clarity in mathematical expressions and suggests that images should be posted in full size for better accessibility.

PREREQUISITES
  • Understanding of Conjunctive Normal Form (CNF)
  • Familiarity with Disjunctive Normal Form (DNF)
  • Basic knowledge of tautologies in propositional logic
  • Proficiency in using $\LaTeX$ for mathematical notation
NEXT STEPS
  • Research the process of converting logical formulas to CNF
  • Study the conversion of logical formulas to DNF
  • Explore the properties and applications of tautologies in logic
  • Learn advanced $\LaTeX$ techniques for presenting mathematical content
USEFUL FOR

Students of mathematics, logic enthusiasts, educators teaching propositional logic, and anyone interested in formal logic and its applications.

hossam killua
Messages
10
Reaction score
0


find cnf and dnf
 
Physics news on Phys.org


my solution can't go far
 
It would be better if you used $\LaTeX$ or at least posted the images not as thumbnails, but full sized so people don't have to click on them, opening up a new tab. :D
 
This formula is a tautology.
 

Similar threads

MHB Solving a Complex Logical Equivalence in CNF Form
  • · Replies 3 ·
Replies
3
Views
2K
Efficient Algorithm for Solving CNF/DNF Logic Problem with 9 Input Literals
  • · Replies 2 ·
Replies
2
Views
2K
Graduate Converting CNF to DNF: Does it Always Work?
  • · Replies 2 ·
Replies
2
Views
16K
MHB Please help with bool algebra and logic things
  • · Replies 2 ·
Replies
2
Views
2K
MHB Finding an Exact Solution for the Recurrence Formula f(n) = 2f(sqrt(n)) + n
  • · Replies 8 ·
Replies
8
Views
5K
MHB NP-complete Proof: 3-SAT is Polynomially Transformable
  • · Replies 3 ·
Replies
3
Views
2K
Graduate A formula provable without is a tautology
  • · Replies 1 ·
Replies
1
Views
2K
Designing a 2-bit Comparator with NOR gates
  • · Replies 7 ·
Replies
7
Views
8K
MHB Maximum Likelihood Estimators for Uniform Distribution
  • · Replies 3 ·
Replies
3
Views
3K
Comp Sci Complexity for generating strings of length k from CNF grammar
  • · Replies 3 ·
Replies
3
Views
2K