°ÝÀÚ, lattice, 30 °áÁ¤ºÒ°¡´É, undecidable, 128 °öÁýÇÕ, product, 7,17 °öÇϱâ, multiplication, 38,45 °ø¿ª, codomain, 8 °øÁýÇÕ, emptyset, 2 °ü°è, relation, 18 ±³ÁýÇÕ, intersection, 2,4 ±Í³³ÁýÇÕ, inductive set, 126 ±Ø´ë¿ø¼Ò, maximal element, 83 ±Ø¼Ò¿ø¼Ò, minimal element, 83 ±ØÇÑ ¼­¼ö, limit ordinal, 119 ±âº»¿­, fundamental sequence, 61 ±â¼ö, cardinal number, 107118 ±âÀú, basis, 89 ²ÀÁöÁ¡, extreme point, 29 ³ëÀ½°ø°£, normed space, 92 ´Ü»çÇÔ¼ö, injective function, 10 ´ëµî, equipotent, 102 ´õÇϱâ, addition, 37,45 µ¥µ¥Å²Æ®Àý´Ü, Dedekind cut, 54 µ¶¸³¼º, independency, 127 µ¿Ä¡°ü°è, equivalence relation, 18 ·µ¼¿ÀÇ ¿ª¼³, Russell's paradox, 123 ¸èÁýÇÕ, power set, 14,15 ¸èÁýÇÕ°ø¸®, The Axiom of Power Set, 126 ¸é, face, 29 ¸ò°ø°£, quotient space, 25 ¸ò»ç»ó, quotient map, 22 ¸òÁýÇÕ, quotient set, 22 ¹«¸ð¼ø¼º, consistency, 127 ¹«ÇÑ°ø¸®, The Axiom of Infinity, 126 ¹«ÇÑÁýÇÕ, infinite set, 15104 ¹Ý»çÀü¼ø¼­, anti-lexicographic order, 95 º£¸®ÀÇ ¿ª¼³, Berry's paradox, 124 º¯¿ª, domain, 8 º¯È¯, transform, transformation, 8 º¼·ÏÁýÇÕ, convex set, 29 ºÎºÐ¼ö¿­, subsequence, 67 ºÎºÐÁýÇÕ, subset, 1 ºÐÇÒ, partition, 19 ºÒ¿ÏÀü¼º Á¤¸®, Incomleteness Theorem, 129 ºñµÑ±â Áý ¿ø¸®, Pigeonhole Principle, 103 »¾¾Æ³ë °ø¸®°è, Peano Axoims, 34 »ç»ó, map, mapping, 8 »ç½½, chain, 82 »ç¿µ, projection, 18 »çÀü¼ø¼­, lexicographic order, 95 »ó, image, 16 »ó°è, upper bound, 27 »óÇÑ, supremum, 27 ¼­·Î¼Ò, mutually disjoint, 6 ¼­¼ö, ordinal number, 99115 ¼±Åðø¸®, The Axiom of Choice, 11,81 ¼±ÅÃÇÔ¼ö, choice function, 81 ¼¿¼ö¾ø´Â, uncountable, 112 ¼¿¼öÀÖ´Â, countable, 112 ¼ö·Å, converge, 61 ¼ö¿­, sequence, 61 ¼öÇÐÀû ±Í³³¹ý, mathematical induction, 35 ¼ø¼­°ü°è, order relation, 26 ¼ø¼­µ¿Çü, order isomorphic, 95 ¼ø¼­½Ö, ordered pair, 6 ¼ø¼­ÁýÇÕ, partially ordered set, 26 ¼ø¼­Ã¼, ordered field, 49 ½ÃÀÛ±â¼ö, initial ordinal, 118 ½Ç¼ö, real number, 55 ¾Æ·¡·Î À¯°è, bounded below, 28 ¾Æ¸£Å°¸Þµ¥½º ¼ºÁú, Archmedian property, 54 ¾ç¼ö, positive number, 49 ¿©ÁýÇÕ, complement, 2 ¿ª»ó, inverse image, 16 ¿ª¿ø, inverse, 45,47 ¿ªÇÔ¼ö, inverse function, 11 ¿¬¼Óü °¡¼³, Continuum Hypothesis, 120 ¿Ïºñ°ÝÀÚ, complete lattice, 30 ¿Ïºñ¼ø¼­Ã¼, complete ordered field, 70 ¿ÏÀü¼º, completeness, 128 À§·Î À¯°è, bounded above, 27 À¯°è¼ö¿­, bounded sequence, 61 À¯¸®¼ö, rational number, 50,67 À¯ÇÑ ¼­¼ö, finite ordinal, 119 À¯ÇÑÁýÇÕ, finite set, 104 ÀÌÇ׿¬»ê, binary operation, 30 ÀÏ¹Ý ¿¬¼Óü °¡¼³, Generalized Continuum Hypothesis, 121 ÀÚ¿¬¼ö, natutal number, 34 Àß Á¤ÀǵÈ, well-defined, 23 Àü´Ü»çÇÔ¼ö, bijective function, 10 Àü»çÇÔ¼ö, surjective function, 10 ÀüüÁýÇÕ, universal set, 2 Àý´Ü, cut, 54 Àý´ë°ª, absolute value, 49 ÀýÆí, initial segment, 94 Á¤·Ä¼ø¼­, well-order, 86 Á¤·ÄÁýÇÕ, well-ordered set, 86 Á¤¼ö, integer, 43 Á¦ÇÑ, restriction, 9 Á¸Àç°ø¸®, The Axiom of Existence, 124 Áõ°¡ÇÔ¼ö, increasing function, 95 ÁøºÎºÐÁýÇÕ, proper subset, 1 ¦°ø¸®, The Axiom of Pair, 126 Â÷ÁýÇÕ, difference, 2 ü, field, 46 ü¸£¸á·Î Á¤·ÄÁ¤¸®, Zermelo Well-ordering Theorem, 88 Ãʸ¥ µµ¿òÁ¤¸®, Zorn's Lemma, 82 ÃÊÀ¯ÇÑ ¼­¼ö, transfinite ordinal, 119 ÃÖ´ëÇÏ°è, greatest lower bounded, 28 ÃÖ¼Ò»ó°è, least upper bounded, 27 ġȯ°ø¸®, The Axiom Schema of Replacement, 126 Äڽüö¿­, Cauchy sequence, 61 Å©´Ù, larger than, 49 Ư¼ºÇÔ¼ö, characteristic function, 15 Æ÷ÇÔÇÔ¼ö, inclusion function, 8 ÇÏ°è, lower bound, 28 ÇϿ콺µµ¸£ÇÁ ±Ø´ë ¿øÄ¢, Hausdorff Maximal Principle, 82 ÇÏÇÑ, infimum, 28 ÇÔ¼ö, function, 8 ÇÔÃà°ø¸®, The Axiom Schema of Comprehension, 125 ÇÕ¼ºÇÕ¼ö, composition, 9 ÇÕÁýÇÕ, union, 2,3 ÇÕÁýÇÕ°ø¸®, The Axiom of Union, 126 Ç×µî¿ø, identity, 45,46,47 Ç×µîÇÔ¼ö, identity function, 8 È®Àå, extensin, 91 È®Àå°ø¸®, The Axiom of Extensionality, 124 ZF °ø¸®°è, ZF Axioms, 127 ZFC °ø¸®°è, ZFC Axioms, 127