Computational Aristotelian Logic - Part 2 of 3

In addition to input propositions, choose the rules of the game!
Klaus Glashoff's Homepage - Contact - Forum
Aim of this site - Short Introduction - Remarks on notation - References and links - NEW: Exercises
Step 1: Insert Input-propositions: Step 2: Choose Syllogisms (press Ctrl for multiple choice)
Syllog.rules:
Axy,Ayz->Axz
Axy,Eyz->Exz
Ixy,Ayz->Ixz
Ixy,Eyz->Oxz
Axy,Ayz->Ixz
Axy,Eyz->Oxz 		Syllog.rules:
Axy,Ezy->Exz
Exy,Azy->Exz
Ixy,Ezy->Oxz
Oxy,Azy->Oxz
Axy,Ezy->Oxz
Exy,Azy->Oxz
Step 3: Choose conversion and/or subaltern. rules:
E-conversion:     Exy->Eyx
I-conversion:     Ixy->Iyx
A-subalternation: Axy->Ixy
E-subalternation: Exy->Oxy
A-pconversion:    Axy->Iyx
E-pconversion:    Exy->Oyx
Syllog.rules:
Ayx,Ayz->Ixz
Ayx,Iyz->Ixz
Iyx,Ayz->Ixz
Ayx,Eyz->Oxz
Ayx,Oyz->Oxz
Iyx,Eyz->Oxz
 		Syllog.rules:
Ayx,Azy->Ixz
Eyx,Azy->Exz
Ayx,Izy->Ixz
Ayx,Ezy->Oxz
Iyx,Ezy->Oxz
Eyx,Azy->Oxz
Identity: ->Axx for all terms x
 Terms x and z allowed to be identical in syllogisms
Step 4:      Example To Part 1 To Part 3
Input-sentences are:

 Output-sentences
(Consequences of the Input-sentences):

Protocoll of syllogistic rules
applied during the derivation:
1: A(x,y)
2: A(y,z)
3: I(u,v)
4: O(u,z)
5: E(v,t)
6: A(y,w)
 6: A(y,w)