←back to thread

303 points FigurativeVoid | 6 comments | | HN request time: 0.384s | source | bottom
1. mihaic ◴[] No.41846803[source]
After Godel published his landmark incompleteness proof, that a logical system can't be complete and also without any internal inconsistencies, I would have expected this to trickle into philosophical arguments of this type.

I see no practical usefulness in all of these examples, except as instances of the rule that you can get correct results from incorrect reasoning.

replies(1): >>41847300 #
2. dist-epoch ◴[] No.41847300[source]
Philosophy is quite far away from pure math for Godel's argument to really matter.
replies(1): >>41847404 #
3. mihaic ◴[] No.41847404[source]
Why though? You lose quite a bit of credibility when you say that theorems that apply to any system of logic don't apply to you in any way.
replies(3): >>41847711 #>>41847762 #>>41847817 #
4. dist-epoch ◴[] No.41847711{3}[source]
If philosophy was just about logic, it would be called math, wouldn't it.

But it's also about fuzzy stuff which doesn't follow the A or not A logic.

5. mjburgess ◴[] No.41847762{3}[source]
Godel's theorem is irrelevant to systems of concepts, conceptual analysis, or theorising in general. It's narrowly about technical issues in logic.

It has been "thematically appropriated" by a certain sort of pop-philosophy, but it says nothing relevant.

Philosophy isnt the activity of trying to construct logical embeddings in deductive proofs. If any one ever thought so, then there's some thin sort of relevance, but no one ever has.

6. rnhmjoj ◴[] No.41847817{3}[source]
Note that Gödel's incompleteness theorems do not apply to just any system of logic: they are about particular formal systems that can prove certain facts about the arithmetics of integers. So, for them to fail, it doesn't even take a non-mathematical formal system, just something that has nothing to do with natural numbers, for example, Euclidean geometry, which happens to be fully decidable.