Groups
Groups
Sign in
Groups
Groups
comp.lang.c++
Conversations
About
Send feedback
Help
Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Learn more
Tarski undefinability totally refuted by junior high school logic
14 views
Skip to first unread message
peteolcott
unread,
May 22, 2019, 11:15:14 PM
5/22/19
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to
Sound deductive inference necessitates true conclusions
therefore sound deductive inference applied to formal
proofs of mathematical logic necessitates true consequences.
The above sentence is 100% of totally all that is needed to
define the True(x) the Tarski "proved" to be impossible to define.
--
Copyright 2019 Pete Olcott All rights reserved
"Great spirits have always encountered violent
opposition from mediocre minds." Albert Einstein
0 new messages