Датотека:Relation1011.svg
From Wikipedia, the free encyclopedia
![Датотека:Relation1011.svg](http://upload.wikimedia.org/wikipedia/commons/thumb/8/88/Relation1011.svg/384px-Relation1011.svg.png)
Оригинална датотека (SVG датотека, номинално 384 × 280 пиксела, величина: 7 kB)
![]() | Ово је датотека са Викимедијине оставе. Информације са њене странице са описом приказане су испод. Викимедијина остава је складиште слободно лиценциралних мултимедијалних датотека. И Ви можете да помогнете. |
Садржај
Опис измене
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 subset relation
The relation tells, that the set
is empty:
=
In written formulas:
The relation tells, that the set
is empty:
Under this condition, several set operations, not equivalent in general, produce equivalent results.
These equivalences define the subset relation:
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 logical implication
The relation tells, that the statement
is never true:
In written formulas:
The relation tells, that the statement
is never true:
Under this condition, several logic operations, not equivalent in general, produce equivalent results.
These equivalences define the logical implication:
Venn diagrams | written formulas |
---|---|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
![]() ![]() ![]() |
|
Especially the last line in this table is important:
The logical implication tells, that the material implication
is always true.
The material implication is the same as
.
Note: Names like logical implication and material implication 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 |
![]() |
Ова датотека не подлеже заштити ауторских права и стога је у јавном власништву, јер се састоји искључиво из података и сазнања која су јавно добро, и не садржи плодове нечијег оригиналног стваралаштва. |
Историја датотеке
Кликните на датум/време да бисте видели тадашњу верзију датотеке.
Датум/време | Минијатура | Димензије | Корисник | Коментар | |
---|---|---|---|---|---|
тренутна | 00:46, 8. мај 2010. | ![]() | 384 × 280 (7 kB) | Watchduck | layout change |
19:59, 26. јул 2009. | ![]() | 384 × 280 (12 kB) | Watchduck | ||
18:13, 10. април 2009. | ![]() | 615 × 463 (4 kB) | Watchduck | {{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 corresponding diagrams of th |
Употреба датотеке
Следећа страница користи ову датотеку:
Глобална употреба датотеке
Други викији који користе ову датотеку:
- Употреба на ca.wikipedia.org
- Употреба на de.wikibooks.org
- Употреба на de.wikiversity.org
- Употреба на en.wikipedia.org
- Употреба на en.wikiversity.org
- Употреба на es.wikipedia.org
- Употреба на ja.wikipedia.org
- Употреба на sh.wikipedia.org