LogFAQs > #957204249

LurkerFAQs, Active DB, DB1, DB2, DB3, DB4, DB5, DB6, DB7, DB8, Database 9 ( 09.28.2021-02-17-2022 ), DB10, DB11, DB12, Clear

Topic List	Page List: 1
Topic	i refuse to accept so-called 'proofs by induction'
PunishedOni 08/18/21 2:16:58 PM #6:	Sahuagin posted... the real numbers are uncountably infinite, so yeah. the integers are countably infinite. ok cool i just invented my own fake numbers called the chelseagers. theyre just like the integers except induction doesnt work. if theyre not real numbers it doesnt even matter bc you can just make them do anything Sahuagin posted... you prove that f(x) _implies_ f(x + 1). not circular. f(x) _implies_ f(x + 1). f(x) ... f(x + 1). x ... x it's circular just admit it --- hi im chelsea ^__^ You have entered the lair of SOMA - the Sega Online Machine Agent. Turn back now, or prepare to be digitized! <cite>PunishedOni posted [p:957204249] in i refuse t... [t:79618819]...</cite> <quote><quote>Sahuagin posted... </cite> the real numbers are uncountably infinite, so yeah. the integers are countably infinite.</quote> ok cool i just invented my own fake numbers called the chelseagers. theyre just like the integers except induction doesnt work. if theyre not real numbers it doesnt even matter bc you can just make them do anything Sahuagin posted... </cite> <quote>you prove that f(x) _implies_ f(x + 1). not circular.</quote> <quote>f(x) _implies_ f(x + 1).</quote> <quote>f(x) ... f(x + 1).</quote> <quote>x ... x</quote> it's circular just admit it --- hi im chelsea ^__^ You have entered the lair of SOMA - the Sega Online Machine Agent. Turn back now, or prepare to be digitized!</quote> ... Copied to Clipboard!
Topic List	Page List: 1