registration
let x1 be Θ1;
.....
let xn be Θn;
identify (a1,...,ak)⊕(ak+1,...,am)
with (b1,...,bj)⊗(bj+1,...,bs);
reducibility
proof
thus (a1,...,ak)⊕(ak+1,...,am)
= (b1,...,bj)⊗(bj+1,...,bs);
end;
end;
{a1,...,am} ⊆ {x1,...,xn}
i {b1,...,bs} ⊆ {x1,...,xn}.
Rejestracja identyczności powoduje utożsamienie
(τa1,...,τak)⊕(τak+1,...,τam)
z (τb1,...,τbj)⊗(τbj+1,...,τbs). | WebForm | |
|---|---|
| TopicClassification | Select one... |
| ProjectGroup? | |
| ImplementationDate? | N/A |