I’m still wrapped us in research today, enough that I don’t have time to produce a quality post. I do however want to correct a statement I made yesterday, that Gödel’s theorem showed that there were statements that could be neither proved nor disproved. That is certainly one interpretation under classical logic, but paraconsistent logic does not force us to accept this. Thus, we could do without N values, possibly (I’ll leave it as an open question for the moment). See: __In Contradiction__ by Graham Priest.

Advertisements