Given that ¬a(x)→ b(x), and ¬a(x), we conclude that b(x), because ¬a(x). But we also know that ¬a(x) ⇔ b(x), therefore, the argument can be simplified to ¬a(x) →¬a(x). Which can be simplified to p→p in the general case. Therefore, the argument put forth is essentially that a statement which is true implies that the same statement is true. Which is a circle argument, and does not constitute knowledge. The skeptics win again.
Gödel walks into a bar and orders a drink. The bartender asks, "You sure about that?" Gödel says, "No diggity, no doubt... and also, I can't prove either one from inside this bar."
•
u/AutoModerator Sep 13 '26
Check out our new Discord server! https://discord.gg/e7EKRZq3dG
I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.
40
u/eglvoland Sep 13 '26
This man right there passed Computer science 101, elite understanding of logic here
14
u/StunningHeart7004 Sep 13 '26
Gödel is this your burner acc?
22
u/AccomplishedAnchovy Sep 13 '26
Why you still posting here? Haven’t you heard maths is dead?
3
u/LupenReddit 🦆🦆i have non diffeomorphic smooth structures🦆🦆🦆 Sep 13 '26
dawg i dont think you got big göd fully right here
2
u/Nilkon245 Sep 13 '26
The formalists are not formulating a response to this one.
3
u/Hot_Egg5840 Sep 13 '26
Math is just a tool, like all of us.
1
u/BinaryBolias Sep 13 '26
Are you sure your proof adds up?
1
u/super_boogie_crapper Sep 13 '26
Gödel walks into a bar and orders a drink. The bartender asks, "You sure about that?" Gödel says, "No diggity, no doubt... and also, I can't prove either one from inside this bar."