perplexus.info :: Algorithms : Logical connectives

Logical connectives (Posted on 2012-01-24)

Let P|Q mean "P and Q are both false." P|Q is true if P and Q are both false, and false otherwise. Define the following logical connectives just using P, Q, |, and parentheses.

1. ~P (not P)
2. P&Q (P and Q)
3. PVQ (P or Q)
4. P->Q (P implies Q)
5. P<->Q (P if and only if Q)

Submitted by Math Man

Rating: 4.6667 (3 votes)

Solution: (Hide)

1. P|P
2. (P|P)|(Q|Q)
3. (P|Q)|(P|Q)
4. ((P|P)|Q)|((P|P)|Q)
5. ((P|P)|Q)|(P|(Q|Q))

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
4&5	Dej Mar	2012-01-24 22:53:01
NOR	Bractals	2012-01-24 16:27:58
solution	Charlie	2012-01-24 16:11:59
Solution if I understand the logic of -> and	Jer	2012-01-24 13:58:26
re: Perplexing Бл Quintuple answered	Math Man	2012-01-24 12:24:39
Perplexing Бл Quintuple answered	Dej Mar	2012-01-24 11:12:04

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info