File:Relation0111.svg
From Wikipedia, the free encyclopedia
![پەڕگە:Relation0111.svg](http://upload.wikimedia.org/wikipedia/commons/thumb/6/63/Relation0111.svg/384px-Relation0111.svg.png)
پەڕگەی سەرەکی (پەڕگەی SVG، بە ناو ٣٨٤ × ٢٨٠ پیکسەڵ، قەبارەی پەڕگە: ٤ کیلۆبایت)
ئەم پەڕگە لە Wikimedia Commonsەوەیە و لەوانەیە لە پڕۆژەکانی دیکەش بەکار ھاتبێت. پێناسەکەی لەسەر پەڕەی وەسفی پەڕگەکە لە خوارەوە نیشان دراوە.
پێڕست
کورتە
This Venn diagram is meant to represent a relation between
- two sets in set theory,
- or two statements in propositional logic respectively.
Set theory: This relation could be called subdisjoint
The relation tells, that the set
is empty:
=
It can be written as or as
.
It tells, that all elements are within the two sets and
:
Example: The set of male first names and the set of female first names are subdisjoint.
But they are not complementary sets, because some names (such as Andrea) can be given to both boys and girls.
Under this condition several set operations, not equivalent in general, produce equivalent results.
These equivalences define subdisjoint sets:
Venn diagrams | written formulas |
---|---|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
The sign tells, that two statements about sets mean the same.
The sign = tells, that two sets contain the same elements.
Propositional logic: The subcontrary relation
The relation tells, that the statement
is never true:
It can be written as or as
.
It tells, that the statements and
are never false together:
Example: The statements "The president's first name could be given to a girl." and "The president's first name could be given to a boy." are subcontrary: They can not be false together. But they are not contradictory, because both statements are true, if the president's first name is e.g. Andrea.
Under this condition several logic operations, not equivalent in general, produce equivalent results.
These equivalences define subcontrary statements:
Venn diagrams | written formulas |
---|---|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
The sign tells, that two statements about statements about whatever objects mean the same.
The sign tells, that two statements about whatever objects mean the same.
![]() |
![]() |
![]() |
![]() |
![]() | |
Set theory: | subset | disjoint | subdisjoint | equal | complementary |
Logic: | implication | contrary | subcontrary | equivalent | contradictory |
Operations and relations in set theory and logic
∅c |
A = A |
|||||||||||||
![]() |
![]() |
|||||||||||||
Ac |
true A ↔ A |
A |
A |
A |
A |
|||||||||
![]() |
![]() |
![]() |
![]() |
|||||||||||
A |
¬A A → ¬B |
A |
A A ← ¬B |
Ac |
A |
A |
A = Bc |
A |
A |
|||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|||||||||
Bc |
A A ← B |
A |
A A ↔ ¬B |
Ac |
¬A A → B |
B |
B = ∅ |
A |
A = ∅c |
A |
A = ∅ |
A |
B = ∅c | |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() | |||||||
¬B |
A |
A |
(A |
¬A |
Ac |
B |
B |
A |
A = B |
A |
B | |||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|||||||||
A |
Ac |
A |
A |
¬A |
A |
|||||||||
![]() |
![]() |
![]() |
![]() |
|||||||||||
¬A |
∅ |
A |
A = Ac |
|||||||||||
![]() |
![]() |
|||||||||||||
false A ↔ ¬A |
A |
|||||||||||||
These sets (statements) have complements (negations). They are in the opposite position within this matrix. |
These relations are statements, and have negations. They are shown in a separate matrix in the box below. |
more relations | ||||
---|---|---|---|---|
|
Public domainPublic domainfalsefalse |
![]() |
This work is ineligible for copyright and therefore in the public domain because it consists entirely of information that is common property and contains no original authorship. |
مێژووی پەڕگە
کرتە بکە لەسەر یەکێک لە ڕێکەوت/کاتەکان بۆ بینینی پەڕگەکە بەو شێوەی لەو کاتەدا بووە.
ڕێکەوت/کات | ھێما | ئەندازە | بەکارھێنەر | تێبینی | |
---|---|---|---|---|---|
هەنووکە | ٢٢:٤٣، ٧ی ئایاری ٢٠١٠ | ![]() | ٣٨٤ لە ٢٨٠ (٤ کیلۆبایت) | Watchduck | layout change |
١٧:٥٧، ٢٦ی تەممووزی ٢٠٠٩ | ![]() | ٣٨٤ لە ٢٨٠ (٢٥ کیلۆبایت) | Watchduck | ||
١٦:٠٨، ١٠ی نیسانی ٢٠٠٩ | ![]() | ٦١٥ لە ٤٦٣ (٤ کیلۆبایت) | Watchduck | ==Description== {{Information |Description={{en|1=Venn diagrams of the sixteen 2-ary Boolean '''relations'''. Black (0) marks empty areas (compare empty set). White (1) means, that there ''could'' be something. There are correspondin |
بەکارھێنانی پەڕگە
ھیچ پەڕەیەک نییە کە ئەم پەڕگەیە بەکاربھێنێت.
بەکارھێنانی سەرانسەریی پەڕگە
ئەم ویکیانەی دیکەی خوارەوەش ئەم پەڕگە بەکاردێنن:
- بەکارھێنان لە en.wikiversity.org