File:Relation1011.svg
From Wikipedia, the free encyclopedia
![Fil:Relation1011.svg](http://upload.wikimedia.org/wikipedia/commons/thumb/8/88/Relation1011.svg/384px-Relation1011.svg.png)
Originalfil (SVG-fil, standardstorlek: 384 × 280 pixlar, filstorlek: 7 kbyte)
![]() |
Denna fil tillhandahålls av Wikimedia Commons. Informationen nedan är kopierad från dess filbeskrivningssida. |
Innehåll
Sammanfattning
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 |
![]() |
Upphovsrätt kan inte tillämpas på detta verk som därmed hamnar i public domain; detta på grund av att verket enbart består av information som är allmän egendom och saknar verkshöjd. |
Filhistorik
Klicka på ett datum/klockslag för att se filen som den såg ut då.
Datum/Tid | Miniatyrbild | Dimensioner | Användare | Kommentar | |
---|---|---|---|---|---|
nuvarande | 8 maj 2010 kl. 00.46 | ![]() | 384 × 280 (7 kbyte) | Watchduck | layout change |
26 juli 2009 kl. 19.59 | ![]() | 384 × 280 (12 kbyte) | Watchduck | ||
10 april 2009 kl. 18.13 | ![]() | 615 × 463 (4 kbyte) | 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 |
Filanvändning
Inga sidor använder den här filen.
Global filanvändning
Följande andra wikier använder denna fil:
- Användande på ca.wikipedia.org
- Användande på de.wikibooks.org
- Användande på de.wikiversity.org
- Användande på en.wikipedia.org
- Användande på en.wikiversity.org
- Användande på es.wikipedia.org
- Användande på ja.wikipedia.org
- Användande på sh.wikipedia.org
- Användande på sr.wikipedia.org