On congruence extension property for ordered algebras
... The case of Hamiltonian algebras An unordered algebra A is called Hamiltonian if every subalgebra B of A is a class of a suitable congruence on A. A variety is called Hamiltonian if all its algebras are Hamiltonian. An unordered algebra is said to have the strong congruence extension property (SCEP ...
... The case of Hamiltonian algebras An unordered algebra A is called Hamiltonian if every subalgebra B of A is a class of a suitable congruence on A. A variety is called Hamiltonian if all its algebras are Hamiltonian. An unordered algebra is said to have the strong congruence extension property (SCEP ...
15 pt How to multiply pictures, and why
... This “skein relation” provides an easy way of calculation for PL by unravelling the knot, crossing by crossing. The skein relation is equivalent to the the quadratic relation we have seen for the braids σi . ...
... This “skein relation” provides an easy way of calculation for PL by unravelling the knot, crossing by crossing. The skein relation is equivalent to the the quadratic relation we have seen for the braids σi . ...
Dynamic logic of propositional assignments
... this, decidability of the satisfiability problem follows. Our result contrasts with both Miller and Moss’s undecidability result for the extension of PAL by the PDL program connectives and with Tiomkin and Makowsky’s undecidability result for the extension of PDL by local assignments. But the decida ...
... this, decidability of the satisfiability problem follows. Our result contrasts with both Miller and Moss’s undecidability result for the extension of PAL by the PDL program connectives and with Tiomkin and Makowsky’s undecidability result for the extension of PDL by local assignments. But the decida ...
Document
... [ApBo94] Krzysztof Apt and Roland Bol, Logic Programming and Negation: A Survey, Journal of Logic Programming, 19/20: 9-71, 1994. ...
... [ApBo94] Krzysztof Apt and Roland Bol, Logic Programming and Negation: A Survey, Journal of Logic Programming, 19/20: 9-71, 1994. ...
A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY Tame
... In Pálfy’s proof we needed that |M | ≥ 3 only to show Claim 1. Thus if all binary polynomials of M satisfy the term-condition then M is polynomially equivalent with a two element vector space, i.e., with E2 . So pick f ∈ Pol2 M which does not satisfy the term-condition. This essentially rules out t ...
... In Pálfy’s proof we needed that |M | ≥ 3 only to show Claim 1. Thus if all binary polynomials of M satisfy the term-condition then M is polynomially equivalent with a two element vector space, i.e., with E2 . So pick f ∈ Pol2 M which does not satisfy the term-condition. This essentially rules out t ...
