>>9
WHAT? I AM NOT WRONG BECAUSE I WAS ARGUING THAT I WAS WRONG, NOT YOU WERE WRONG! THEREFORE I AM VERY SMART
Name:
Anonymous2009-03-04 4:32
>>11
is smart. It's /prog/ that is stupid for responding to him. They think that their smart for showing how he is wrong or that they are arguing their point when they don't know that THBT and are turning every thread into "HER HER JAVASCRIPT IS THE BEST!", "DUR HUR NO ITS NOT!"
_________
I, the creator of this work, hereby grant the permission to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
Name:
Anonymous2013-08-31 23:06
If the axiom of choice holds, every cardinal κ has a successor κ+ > κ, and there are no cardinals between κ and its successor. For finite cardinals, the successor is simply κ + 1. For infinite cardinals, the successor cardinal differs from the successor ordinal.
Name:
Anonymous2013-08-31 23:52
In real analysis, the symbol \infty, called "infinity", denotes an unbounded limit. x ightarrow \infty means that x grows without bound, and x o -\infty means the value of x is decreasing without bound. If f(t) ≥ 0 for every t, then
Name:
Anonymous2013-09-01 0:37
Cognitive scientist George Lakoff considers the concept of infinity in mathematics and the sciences as a metaphor. This view is based on the basic metaphor of infinity (BMI), defined as the ever-increasing sequence <1,2,3,...>.
Name:
Anonymous2013-09-01 1:22
The field of effective descriptive set theory is between set theory and recursion theory. It includes the study of lightface pointclasses, and is closely related to hyperarithmetical theory. In many cases, results of classical descriptive set theory have effective versions; in some cases, new results are obtained by proving the effective version first and then extending ("relativizing") it to make it more broadly applicable.
Name:
Anonymous2013-09-01 2:08
orall X \left[ \emptyset
otin X \implies \exists f: X arr igcup X \quad orall A \in X \, ( f(A) \in A ) ight] \,.
Name:
Anonymous2013-09-01 2:53
Although the axiom of countable choice in particular is commonly used in constructive mathematics, its use has also been questioned.