On the equational theory of finite modular lattices

Abstract

It is shown that there is $N$ such that there is no algorithm to decide for identities in at most $N$ variables validity in the class of finite modular lattices. This is based on Slobodskoi's result that the Restricted Word Problem is unsolvable for the class of finite groups and relies on Freese's technique of capturing group presentations within free modular lattices.