((P=P)=(-P=-P)) v ((P=P)=/=(-P=-P))
viewtopic.php?f=26&t=28741
Exists as is, at best a philosopher can do is ignore it.
It's a statement about an empirical phenomenon. I am merely reporting what I am observing.
I may not be a Ruby guy, but...Skepdick wrote: ↑Sat Mar 14, 2020 11:43 pm Like I have demonstrated 100 times before, here is a real-world logical system which evaluates (P ∧ ¬P) ⇔ True
https://repl.it/repls/ShowyMiniGuiltware
Code: Select all
$toggle = false
def p
$toggle = (not $toggle)
end
print (p and (not p)) == true
Sure. You understand WHY it evaluates to false.FlashDangerpants wrote: ↑Sun Mar 15, 2020 1:13 am Surely all that does is evaluate the p and not p sequentially, not at once, whilst flipping p between True and False in the process.
Sort of cheating by inserting a modality, no?
Irrelevant. The law of non contradiction doesn't break if the asserted P is that henry is wearing a hat, and that then henry takes off his hat, so now henry is not wearing a hat. But your code blatantly does exactly that.Skepdick wrote: ↑Sun Mar 15, 2020 1:16 amSure. You understand WHY it evaluates to false.FlashDangerpants wrote: ↑Sun Mar 15, 2020 1:13 am Surely all that does is evaluate the p and not p sequentially, not at once, whilst flipping p between True and False in the process.
Sort of cheating by inserting a modality, no?
"P and not P" is a sequential expression.
If you insist that "P and not P" needs to be evaluated "at once" you need to define what that means.
Change absolutely breaks any and all asserted P, unless you are explicit about your time-interval. What my code does is irrelevant because it's a white box (you can see what it's doing.- you are operating under omniscience). Suppose P was a black box to you - a noumenon.FlashDangerpants wrote: ↑Sun Mar 15, 2020 1:22 am Irrelevant. The law of non contradiction doesn't break if the asserted P is that henry is wearing a hat, and that then henry takes off his hat, so now henry is not wearing a hat. But your code blatantly does exactly that.
Change over time is not cheating, moron. Change is fact of this universe.FlashDangerpants wrote: ↑Sun Mar 15, 2020 1:34 am Dude. You cheated and you got caught. Just eat the loss like a grown up.
Then stop projecting your butthurt alpha-maleness at me.FlashDangerpants wrote: ↑Sun Mar 15, 2020 1:39 am You don't have to ramp up the conflict and get all butthurt and alpha male at me either. I am giving you good advice, you would be smart to take it.
Bullshit. My code asserted/evaluated ¬(P ∧ ¬P) as False.FlashDangerpants wrote: ↑Sun Mar 15, 2020 1:46 am Your code did not assert a contradiction. It evaluated true == true.
If you don't like the incoherent definition of a contradiction - fix it.FlashDangerpants wrote: ↑Sun Mar 15, 2020 1:46 am None of these additional shenanigans are helping you.
It evaluated true == true.Skepdick wrote: ↑Sun Mar 15, 2020 1:52 amBullshit. My code asserted/evaluated ¬(P ∧ ¬P) as False.FlashDangerpants wrote: ↑Sun Mar 15, 2020 1:46 am Your code did not assert a contradiction. It evaluated true == true.
Code: Select all
$toggle = false
def p
$toggle = (not $toggle)
end
print ((not p) and p) == true
It evaluated P and ¬P.
The LNC doesn't prescribe evaluation order. All you are demonstrating is that ordering matters in the real world. Like Causality or something. Well done! We'll make a physics out of you.FlashDangerpants wrote: ↑Sun Mar 15, 2020 2:00 am In fact, all it takes to break your code is to evaluate p and not p in a different order.
Only by setting them to the same value so that they weren't contradictory. Which is a useless way to test a law about contradictions.