23-я из стрима БУ

 Законы алгебры логики

   (x1≡x2) = (x1^x2) v ( !x1^!x2)

Система

(x1≡x2) v (x1≡x3)=1
(x2≡x3) v (x2≡x4)=1
(x3≡x4) v (x3≡x5)=1
(x4≡x5) v (x4≡x6)=1
(x5≡x6) v (x5≡x7)=1
(x6≡x7) v (x6≡x8)=1

Solution of systems of Boolean equations kind of P204 with three variables via format 08/2016

Once again I strongly believe that technique proposed in http://kpolyakov.spb.ru/download/mea-2016-8.pdf seems to be underestimated either not well understood until date. Regardless Unified State Examination Polyakov's forum contains more then enough samples demonstrating advantages of 08.2016 technique. A poor understanding of the ideology 08.2016 in essence for today means a lack of understanding what  kind of flexibility and power Mapping Method provides for USE in  Informatics developers in meantime. 

Original system 

(((x1≡y1)≡z1) =>((x2≡y2)≡z2)) ^ (x1 v y1 v z1)=1
(((x2≡y2)≡z2) =>((x3≡y3)≡z3)) ^ (x2 v y2 v z2)=1
(((x3≡y3)≡z3) =>((x4≡y4)≡z4)) ^ (x3 v y3 v z3)=1
(((x4≡y4)≡z4) =>((x5≡y5)≡z5)) ^ (x4 v y4 v z4)=1
(((x5≡y5)≡z5) =>((x6≡y6)≡z6)) ^ (x5 v y5 v z5)=1
(((x6≡y6)≡z6) =>((x7≡y7)≡z7)) ^ (x6 v y6 v z6)=1
(x7 v y7 v z7)=1

As soon as we have a conditions that allow us to determine the bits of x(j),y(j),z(j)  for the arrows outgoing from the node of the 08/2016 chart, we can start. In particular case, we are ready to go ahead with  08/2016 chart style.  In other words, we have to know bits combination {x,y,z} associated with arrows connecting  neighboring nodes in chart . 

   Cloning to {x,y,z} systems like P175 or P116 is quite straight forward