https://conservapedia.com/api.php?action=feedcontributions&feedformat=atom&user=BenjB 2026-06-09T15:17:08Z User contributions MediaWiki 1.24.2 https://conservapedia.com/index.php?title=Talk:Axiom_of_Choice&diff=381794 2008-01-28T01:31:41Z

<p>BenjB: New page: == Not really controversial anymore == Any proof which uses the axiom of choice can be transformed into a proof that doesn't. Granted, it will be a somewhat more complicated proof, but i...</p> <hr /> <div>== Not really controversial anymore ==<br /> <br /> Any proof which uses the axiom of choice can be transformed into a proof that doesn't. Granted, it will be a somewhat more complicated proof, but it always works, and that's a fact. That is the reason that AC is much less controversial these days than it was, in the early 1900s. <br /> <br /> There is a complete explanation of the process and the proof that it's reliable [http://web.unicam.it/matinf/aila/Scuola%20AILA/sulla%20varieta%20dei%20metodiAC_sem02.pdf here]. <br /> <br /> Also, the profoundly intuitive [http://en.wikipedia.org/wiki/Trichotomy_%28mathematics%29 trichotomy] is equivalent to AC, so be careful what you call controversial. [[User:BenjB|BenjB]] 20:29, 27 January 2008 (EST)</div>

BenjB https://conservapedia.com/index.php?title=Talk:Fermat%27s_Last_Theorem&diff=381793 2008-01-28T01:31:02Z

<p>BenjB: /* Axiom of choice */</p> <hr /> <div>The first computer program I wrote - between high school and college - generated solutions to the Pythagorean Theorem. I guess I should have programmed it to count them, too. --[[User:Ed Poor|Ed Poor]] &lt;sup&gt;[[User talk:Ed Poor|Talk]]&lt;/sup&gt; 21:25, 20 December 2007 (EST)<br /> <br /> == Axiom of choice ==<br /> <br /> Any proof which uses the [[axiom of choice]] can be transformed into a proof that doesn't. Granted, it will be a somewhat more complicated proof, but it always works, and that's a fact. That is the reason that AC is much less controversial these days than it was, in the early 1900s. <br /> <br /> There is a complete explanation of the process and the proof that it's reliable [http://web.unicam.it/matinf/aila/Scuola%20AILA/sulla%20varieta%20dei%20metodiAC_sem02.pdf here]. <br /> <br /> Also, the profoundly intuitive [http://en.wikipedia.org/wiki/Trichotomy_%28mathematics%29 trichotomy] is equivalent to AC, so be careful what you call controversial. [[User:BenjB|BenjB]] 20:29, 27 January 2008 (EST)</div>

BenjB https://conservapedia.com/index.php?title=Talk:Fermat%27s_Last_Theorem&diff=381791 2008-01-28T01:29:54Z

<p>BenjB: Axiom of choice</p> <hr /> <div>The first computer program I wrote - between high school and college - generated solutions to the Pythagorean Theorem. I guess I should have programmed it to count them, too. --[[User:Ed Poor|Ed Poor]] &lt;sup&gt;[[User talk:Ed Poor|Talk]]&lt;/sup&gt; 21:25, 20 December 2007 (EST)<br /> <br /> == Axiom of choice ==<br /> <br /> Any proof which uses the axiom of choice can be transformed into a proof that doesn't. Granted, it will be a somewhat more complicated proof, but it always works, and that's a fact. That is the reason that AC is much less controversial these days than it was, in the early 1900s. <br /> <br /> There is a complete explanation of the process and the proof that it's reliable [http://web.unicam.it/matinf/aila/Scuola%20AILA/sulla%20varieta%20dei%20metodiAC_sem02.pdf here]. <br /> <br /> Also, the profoundly intuitive [http://en.wikipedia.org/wiki/Trichotomy_%28mathematics%29 trichotomy] is equivalent to AC, so be careful what you call controversial. [[User:BenjB|BenjB]] 20:29, 27 January 2008 (EST)</div>

BenjB