安装 Steam
登录
|
语言
繁體中文(繁体中文)
日本語(日语)
한국어(韩语)
ไทย(泰语)
български(保加利亚语)
Čeština(捷克语)
Dansk(丹麦语)
Deutsch(德语)
English(英语)
Español-España(西班牙语 - 西班牙)
Español - Latinoamérica(西班牙语 - 拉丁美洲)
Ελληνικά(希腊语)
Français(法语)
Italiano(意大利语)
Bahasa Indonesia(印度尼西亚语)
Magyar(匈牙利语)
Nederlands(荷兰语)
Norsk(挪威语)
Polski(波兰语)
Português(葡萄牙语 - 葡萄牙)
Português-Brasil(葡萄牙语 - 巴西)
Română(罗马尼亚语)
Русский(俄语)
Suomi(芬兰语)
Svenska(瑞典语)
Türkçe(土耳其语)
Tiếng Việt(越南语)
Українська(乌克兰语)
报告翻译问题
/)─―ヘ
_/ \
/ ● ●丶
| ▼ |
| 亠ノ
U ̄U ̄ ̄ ̄ ̄U ̄
+rep
.
The ⊢ symbol has not changed; it means that the formula to which it applies is asserted to be true. ⊃ is logical implication, and ≡ is logical equivalence. Λ is the empty set, which we write nowadays as ∅. ∩ ∪ and ∈ have their modern meanings: ∩ and ∪ are the set intersection and the union operators, and x∈y means that x is an element of set y.
The remaining points are semantic. α and β are sets. 1 denotes the set of all sets that have exactly one element. That is, it's the set { c : there exists a such that c = { a } }. Theorems about 1 include, for example:
that Λ∉1 (∗52.21),
that if α∈1 then there is some x such that α = {x} (∗52.1), and
that {x}∈1 (∗52.22).
2 is similarly the set of all sets that have exactly two elements. An important theorem about 2 is ∗54.3, which says
∗54.3.⊢2=α^{(∃x).x∈α.α−ι‘x∈1}.