I'm really dumbstruck by this. Any help will be appreciated!
How do i go from--> (¬A ∧ ¬K) ∨ (A ∧ K)
to
(¬K ∨ A) ∧ (¬A ∨ K)?
How do i go from--> (¬A ∧ ¬K) ∨ (A ∧ K)
to
(¬K ∨ A) ∧ (¬A ∨ K)?
Need help with propositional logic!?
- Thread starter raystriker
- Start date
- Views 1,375
- Replies 3
Solution
Forgive my messiness.
2. Apply double De Morgan so we can change the insides without messing up the logic.
3. - 4. Carry through one of the De Morgans to the insides all the way down.
5. Treat "ands" like multiplication and "ors" like +'s, foil. Discard terms that are always false (it's okay to do this, as we are or'ing terms here).
6. - 8. Carry second De Morgan negation all the way down.
Bonus logic table for part 4.
2. Apply double De Morgan so we can change the insides without messing up the logic.
3. - 4. Carry through one of the De Morgans to the insides all the way down.
5. Treat "ands" like multiplication and "ors" like +'s, foil. Discard terms that are always false (it's okay to do this, as we are or'ing terms here).
6. - 8. Carry second De Morgan negation all the way down.
Bonus logic table for part 4.
Forgive my messiness.
2. Apply double De Morgan so we can change the insides without messing up the logic.
3. - 4. Carry through one of the De Morgans to the insides all the way down.
5. Treat "ands" like multiplication and "ors" like +'s, foil. Discard terms that are always false (it's okay to do this, as we are or'ing terms here).
6. - 8. Carry second De Morgan negation all the way down.
Bonus logic table for part 4.
2. Apply double De Morgan so we can change the insides without messing up the logic.
3. - 4. Carry through one of the De Morgans to the insides all the way down.
5. Treat "ands" like multiplication and "ors" like +'s, foil. Discard terms that are always false (it's okay to do this, as we are or'ing terms here).
6. - 8. Carry second De Morgan negation all the way down.
Bonus logic table for part 4.
So you can see it better 
