File:Relation1001.svg
From Wikipedia, the free encyclopedia
![پەڕگە:Relation1001.svg](http://upload.wikimedia.org/wikipedia/commons/thumb/1/1f/Relation1001.svg/384px-Relation1001.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: The equivalence of sets
Two sets and
are equivalent - i.e. contain the same elements - when all elements of
are in
, and all elements of
are in
.
In other words: If their symmetric difference is empty.
![]() |
|
![]() |
![]() |
|
![]() |
= | ![]() | |
|
|
= |
Under this condition, several set operations, not equivalent in general, produce equivalent results.
These equivalences define equivalent sets:
![]() |
|
![]() |
= | ![]() |
= | ![]() |
= | ![]() |
= | = | = |
![]() |
|
![]() |
= | ![]() |
= | ![]() |
= | ![]() |
= | = | = |
![]() |
|
![]() |
= | ![]() |
= | ![]() |
= | ![]() |
= | = | = |
![]() |
|
![]() |
= | ![]() |
= | ![]() |
= | ![]() |
= | = | = |
The sign tells, that two statements about sets mean the same.
The sign = tells, that two sets contain the same elements.
Propositional logic: The equivalence of statements
Two statements and
are equivalent - i.e. together true or together false - when
implies
, and
implies
.
In other words: If their exclusive or is never true.
![]() |
|
![]() |
![]() |
|
![]() |
![]() | ||
|
|
Under this condition, several logic operations, not equivalent in general, produce equivalent results.
These equivalences define equivalent statements:
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
![]() |
|
![]() |
|
![]() |
|
![]() |
|
![]() |
Especially the last line is important:
The logical equivalence tells, that the material equivalence
is always true.
The material equivalence is the same as
, the negated exclusive or.
Note: Names like logical equivalence and material equivalence are used in many different ways, and shouldn't be taken too serious.
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 |
بەکارھێنانی پەڕگە
ھیچ پەڕەیەک نییە کە ئەم پەڕگەیە بەکاربھێنێت.
بەکارھێنانی سەرانسەریی پەڕگە
ئەم ویکیانەی دیکەی خوارەوەش ئەم پەڕگە بەکاردێنن:
- بەکارھێنان لە ca.wikipedia.org
- بەکارھێنان لە de.wikibooks.org
- بەکارھێنان لە es.wikipedia.org
- بەکارھێنان لە ja.wikipedia.org