= 27d567bc2d48d9f40e9ccc20ea370b15)
Nornagest comments on How to Not Lose an Argument - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (409)
The case of P(n) -> P(n+1) (i.e., the second part of the induction argument) that fails is n=1. (In other words n+1 = 2).
The second part of the induction argument must begin (i.e., include n >= n0) at the value n0 that you have proven in the first part to be true from 1 to n0. In this case n0 = 1, so you must begin the induction at n = 1.
You're right, of course. I was trying to describe the flaw in the set-overlap assumption without actually going through an inductive step, on the assumption that that would be clearer, but in retrospect my phrasing muddled that.
I'll see if I can fix that.