Датотека:Relation1110.svg
From Wikipedia, the free encyclopedia
![Датотека:Relation1110.svg](http://upload.wikimedia.org/wikipedia/commons/thumb/0/0e/Relation1110.svg/384px-Relation1110.svg.png)
Оригинална датотека (SVG датотека, номинално 384 × 280 пиксела, величина: 4 kB)
![]() | Ово је датотека са Викимедијине оставе. Информације са њене странице са описом приказане су испод. Викимедијина остава је складиште слободно лиценциралних мултимедијалних датотека. И Ви можете да помогнете. |
![](https://upload.wikimedia.org/wikipedia/commons/thumb/3/34/Inkscape-ws.svg/22px-Inkscape-ws.svg.png)
Садржај
Опис
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 disjoint relation
The relation tells, that the set
is empty:
=
It can be written as or as
.
It tells, that the sets and
have no elements in common:
Example: The set of positive numbers and the set of negative numbers are disjoint: No number is both positive and negative.
But they are not complementary sets, because the zero is neither positive nor negative.
Under this condition several set operations, not equivalent in general, produce equivalent results.
These equivalences define disjoint 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 contrary 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 true together:
Example: The statements "Number x is positive." and "Number x is negative." are contrary:
They can not be true together. But they are not contradictory, because both statements are false for x=0.
Under this condition several logic operations, not equivalent in general, produce equivalent results.
These equivalences define contrary 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 |
![]() |
Ова датотека не подлеже заштити ауторских права и стога је у јавном власништву, јер се састоји искључиво из података и сазнања која су јавно добро, и не садржи плодове нечијег оригиналног стваралаштва. |
Историја датотеке
Кликните на датум/време да бисте видели тадашњу верзију датотеке.
Датум/време | Минијатура | Димензије | Корисник | Коментар | |
---|---|---|---|---|---|
тренутна | 00:50, 8. мај 2010. | ![]() | 384 × 280 (4 kB) | Watchduck | layout change |
20:01, 26. јул 2009. | ![]() | 384 × 280 (9 kB) | Watchduck | ||
18:16, 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
- Употреба на en.wikiversity.org
- Употреба на es.wikipedia.org
- Употреба на fr.wikiquote.org