News for hackers. Stuff that matters.
Re:All Horses Are the Same Color by tomtomlapomme on Saturday December 04, 2021 @07:26PM (#29445629)
This is how induction proof work. You prove that something is true for a base (n = 1) case then you prove that if it is true for n it has to be true for n + 1. Therefore it is true for any n.

The flaw is that the second part of the proof requires n >= 2

Re:All Horses Are the Same Color by thwd on Saturday December 04, 2021 @07:28PM (#29445638)
I understand and agree but read carefully. The assumption _is_ the (entire) hypothesis. It is not existentially quantified or set in the base-case. It is the entire hypothesis.
Re:All Horses Are the Same Color by ashtonbaker on Saturday December 04, 2021 @07:52PM (#29445778)
You should read “n” as “some arbitrary n” in the quote you posted. It’s not an assumption for all n.

edit: sorry, you’re right that the wording is a bit sloppy. The “n” in the first quote is “for all n” and the n in the second quote is “some specific n” or “some arbitrary n”. They’re not meant to be the same statement. I don’t think it’s a very carefully written article.

Re:All Horses Are the Same Color by shkkmo on Saturday December 04, 2021 @09:44PM (#29446300)
The assumption that the case holds for n while the goal is to show the case holds for n+1. It is not well worded to make clear the intent of making an assumption about modal possibility. However, to see it as begging the question requires imposing a statement of modal necessity that simply isn't there.