Now, we CAN falsify cardinal, ordinal, set, computational and operational claims

Now, we CAN falsify cardinal, ordinal, set, computational and operational claims because of differences in reducibility of each of those domains. ie: mathematical reducibility is small, computational is larger, operational is larger, and verbal (set) is even larger). 😉


Source date (UTC): 2022-09-07 14:17:36 UTC

Original post: https://twitter.com/i/web/status/1567517443127447552

Reply addressees: @KWintie

Replying to: https://twitter.com/i/web/status/1567515897966874625

Comments

Leave a Reply

Your email address will not be published. Required fields are marked *