TAFA -- a tool for admissibility in finite algebras Checking whether a quasiequation is admissible in a finitely generated quasivariety is known to be decidable by checking validity in a suitable (finite) free algebra on finitely many generators. Nevertheless this approach is computationally unfeasible since these free algebras can be very big. TAFA is a system providing algebraic tools to search for the smallest set of algebras, according to the standard multiset well-ordering, such that a quasiequation is admissible in the quasivariety if and only if it is valid in this set of algebras.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element