User:Watchduck/Logic
Contents
Operations[edit]
Relations[edit]
XNOR and XOR  


XNOR and XOR  


In different universes[edit]
Are operations relations in a 1element universe?  


1element universe:
2element universe:
3element universe:
4element universe  first example with 15 minterm relations:
5element universe:
(zoom in) 
(zoom in) 
(zoom in) 
Parity relations[edit]
Usually the question is, if somewhere are no or some elements.
But one may also ask, if somewhere is an even or an odd number of elements.
Parity relations have a Hadamard pattern where the others have a Sierpinski triangle .
In a 1element universe even means 0, and odd means 1:
2element universe:
3element universe:
4element universe:
5element universe:
(zoom in) 
(zoom in) 
(zoom in) 
Examples[edit]
In is an even number of elements.  


In is an odd number of elements.  


This is a different way to write the same:
In is an odd number of elements.  


This is what the exclusive or excludes:
It's not to be confused with:
Just another example:
3ary relations[edit]



There are 256 relations of this kind (corresponding to the 256 operations).
The 22 relations in the following table are shown in place of their mirrorings and rotations:

 

 

 

Propositional calculus examples: drivers and medics[edit]
A proposition is uniquely determined by the set of all cases, in which it is true.
This set could be called the proposition's validity set.
Two propositions are equal, when they have the same validity set.
The validity set of a negation is the complement of the initial proposition's validity set.
So to know the negation of a proposition, one has to know the set of all possible cases.
The set of all possible cases is the validity set of the tautology. It may be denoted .
The empty set is the validity set of the contradiction.
Cases that can be the case and propositions that can be said are essentially different objects.
(Similar to outcomes and events in probability theory.)
When there are n possible cases, there are 2^{n} possible propositions.
Among them are n elementary propositions (minterms). They have a 1element validity set, and thus they are true in exactly one case.
(Cases and corresponding elementary propositions are easily mixed up  like outcomes and elementary events in probability theory.)
A single employee[edit]
One may be interested, if an employee is a driver or a medic.
There are exactly four possiblities (cases), how he can have these qualities or not:
Exactly one of these statements will be true about a certain employee.
In respect to these qualities there are 2^{4} = 16 statements (propositions), one can say about this employee:
 "He is M."
 "He is D or M." (E.g.: "He must be D or M, otherwise he would not be part of this project.")
A group of employees[edit]
One may be interested, which of the following statements are true about a certain group of employees:
 "Someone is neither D, nor M."
 "Someone is D, but not M."
 "Someone is not D, but M."
 "Someone is D and M."
These statements don't contradict each other. At least one will be true about a certain group of employees.
(Assumed, that the group consists of at least one employee.)
There are 15 possible cases:
 All are not D, but M.
 All are not D, among them are M and notM.
 There are D and M, but no one is both.
So there are 2^{15} = 32768 propositions one can say about a particular group of employees:
Examples[edit]
with the validity set:  {  } 
with the validity set:  {  } 
with the validity set:  {  } 
with the validity set:  {  } 
with the validity set:  {  } 
with the validity set:  {  } 