最終更新日：2022/12/23
例文
The
finite
axiom
of
choice
is
not
an
axiom,
but
rather
a
theorem
that
can
be
proved
from
the
other
axioms.
In
contrast,
there
are
weak
forms
of
the
axiom
of
choice
that
are
not
provable.
One
example
is
the
axiom
of
countable
choice,
which
states
that
if
A_0,A_1,…A_n…
form
a
denumerable
set
of
nonempty
sets,
their
product
is
nonempty.
[…]
The
axiom
of
countable
choice
is
constantly
used
in
analysis;
it
is
often
hidden
so
as
not
to
sow
confusion
in
the
minds
of
the
students
(who
are
inclined
to
accept
anything
desired)
or
of
the
professors
(who
do
not
like
to
shake
the
foundations
of
the
discipline).
復習用の問題
The finite axiom of choice is not an axiom, but rather a theorem that can be proved from the other axioms. In contrast, there are weak forms of the axiom of choice that are not provable. One example is the axiom of countable choice, which states that if A_0,A_1,…A_n… form a denumerable set of nonempty sets, their product is nonempty. […] The axiom of countable choice is constantly used in analysis; it is often hidden so as not to sow confusion in the minds of the students (who are inclined to accept anything desired) or of the professors (who do not like to shake the foundations of the discipline).
音声機能が動作しない場合はこちらをご確認ください
英語 - 英語
項目の編集設定
- 項目の編集権限を持つユーザー - すべてのユーザー
- 項目の新規作成を審査する
- 項目の編集を審査する
- 項目の削除を審査する
- 重複の恐れのある項目名の追加を審査する
- 項目名の変更を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
例文の編集設定
- 例文の編集権限を持つユーザー - すべてのユーザー
- 例文の削除を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
問題の編集設定
- 問題の編集権限を持つユーザー - すべてのユーザー
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
