Logical equivalencies involving ifs and nors

  • Thread starter nicnicman
  • Start date
  • #1
136
0

Main Question or Discussion Point

Can anyone solve this step by step, so I can see how it's done? I've been at for a while now and can't seem to get it. Here's the problem:

Find a compound proposition logically equivalent to p → q using only the logical operator ↓.

Thanks for the help. I'm really trying to get this stuff, but it's not coming easy.
 

Answers and Replies

  • #2
haruspex
Science Advisor
Homework Helper
Insights Author
Gold Member
33,757
5,552
The trick is to obtain a NOT function by p NOR p. That breaks the symmetry.
 
  • #3
136
0
Thanks for the suggestion, I finally got it.

If anyone's interested:

p → q
≡ ¬p ∨ p this is one of the common equivalencies given in my book by Deitel
≡ ¬(¬p ↓ p) this equivalency was found in a previous exercise
≡ ¬((p ↓ p) ↓ q) by ¬p ≡ p ↓p
≡ ((p ↓ p) ↓ q) ↓ ((p ↓ p) ↓ q) by ¬p ≡ p ↓p
 

Related Threads on Logical equivalencies involving ifs and nors

  • Last Post
Replies
2
Views
2K
  • Last Post
Replies
2
Views
667
Replies
2
Views
3K
  • Last Post
Replies
3
Views
2K
Replies
6
Views
696
  • Last Post
Replies
5
Views
2K
Replies
3
Views
1K
Replies
6
Views
2K
Replies
3
Views
3K
  • Last Post
Replies
17
Views
1K
Top