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

Discussion Overview

The discussion revolves around the determination of whether a given formula is a tautology by finding its Conjunctive Normal Form (CNF) and Disjunctive Normal Form (DNF). The scope includes theoretical aspects of logic and mathematical reasoning.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested

Main Points Raised

  • One participant suggests finding the CNF and DNF as a method to determine if a formula is a tautology.
  • Another participant expresses difficulty in progressing with their solution.
  • A third participant comments on the presentation of the solution, recommending the use of $\LaTeX$ for clarity.
  • One participant asserts that the formula is a tautology without providing supporting details.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the effectiveness of the proposed method, and there are competing views regarding the status of the formula as a tautology.

Contextual Notes

There are limitations in the clarity of the presented solutions and the assumptions regarding the formula's properties are not fully explored.

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