In order to truly make this a paradox, you would need to qualify at the beginning that both statements are either true or false.
If both statements are true, it's a paradox because they cannot both be true.
If both statements are false, it's a paradox because they cannot both be false.
There is no such qualifer to this "puzzle"; therefore, it's philosophy.
But it does provoke thought, doesn't it? That's what philosophy does.
Welcome to BrainDen.com - Brain Teasers Forum
![]() |
Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account. As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends. Of course, you can also enjoy our collection of amazing optical illusions and cool math games. If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top. If you have a website, we would appreciate a little link to BrainDen. Thanks and enjoy the Den :-) |
Guest Message by DevFuse
Double Liar Paradox (Jourdain's paradox)
Started by rookie1ja, Jun 09 2007 12:44 PM
62 replies to this topic
#61
Posted 12 October 2012 - 12:46 AM
#62
Posted 25 October 2012 - 08:18 AM
Here are the facts:
Front= "THE SENTENCE ON THE OTHER SIDE OF THIS CARD IS FALSE."
Back= "THE SENTENCE ON THE OTHER SIDE OF THIS CARD IS TRUE."
You can start with either side, it does not matter. Let's use "-n" to specify deniability, and let's start with BACK:
Back = Front = -nBack = -nFront = -n-nBack = -n-nFront = -n-n-nBack = -n-n-nFront = -n-n-n-nBack = -n-n-n-nFront = etc. = etc.
It is an infinite loop of deniability. By starting with BACK, first, assumes truth until the loop cycles back to BACK and deniability begins, infinitely. Starting with FRONT initiates the infinite loop immediately, but intuition of using the FRONT, first, should call the question of "when did this start in the first place?" (there was no beginning, it has always been), because we could have started with BACK initially... See how this works?
Added:
This problem has two flows: a reverse flow
Front= "THE SENTENCE ON THE OTHER SIDE OF THIS CARD IS FALSE."
Back= "THE SENTENCE ON THE OTHER SIDE OF THIS CARD IS TRUE."
You can start with either side, it does not matter. Let's use "-n" to specify deniability, and let's start with BACK:
Back = Front = -nBack = -nFront = -n-nBack = -n-nFront = -n-n-nBack = -n-n-nFront = -n-n-n-nBack = -n-n-n-nFront = etc. = etc.
It is an infinite loop of deniability. By starting with BACK, first, assumes truth until the loop cycles back to BACK and deniability begins, infinitely. Starting with FRONT initiates the infinite loop immediately, but intuition of using the FRONT, first, should call the question of "when did this start in the first place?" (there was no beginning, it has always been), because we could have started with BACK initially... See how this works?
Added:
This problem has two flows: a reverse flow
Edited by ACuriousMind, 25 October 2012 - 08:25 AM.
#63
Posted 25 October 2012 - 09:11 AM
The edit rules are very stringent in this forum, and the edit button did not seem to appear after the "10 min rule". Anyway, from my above post, this is supposed to be the finalized edit:
Added:
This problem tends to have a reverse chronological flow, because the mind attempts to unravel the pattern as soon as the illogical loop is recognized, to find any initializing details.
Added:
This problem tends to have a reverse chronological flow, because the mind attempts to unravel the pattern as soon as the illogical loop is recognized, to find any initializing details.
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users





