Algebras with modular lattice reducts and simple subdirectly irreducibles. - Joel Berman (Discret. Math., 1975)

A Model Theoretic Approach to Malcev Conditions. - John T. Baldwin 001; Joel Berman (J. Symb. Log., 1977)

A proof of Lyndon's finite basis theorem. - Joel Berman (Discret. Math., 1980)

Clones satisfying the term condition. - Joel Berman; Ralph McKenzie (Discret. Math., 1984)

The value of free algebras. - Joel Berman (Algebraic Logic and Universal Algebra in Computer Science, 1988)

Positive Boolean Dependencies. - Joel Berman; Willem J. Blok (Inf. Process. Lett., 1988)

Equational Dependencies. - Joel Berman; Willem J. Blok (J. Inf. Process. Cybern., 1992)

The set of types of a finitely generated variety. - Joel Berman; Emil W. Kiss; Péter Pröhle; Ágnes Szendrei (Discret. Math., 1993)

Free spectra Gaps and Tame Congruence Types. - Joel Berman (Int. J. Algebra Comput., 1995)

Finite distributive lattices and doubly irreducible elements. - Joel Berman; Gabriela Hauser Bordalo (Discret. Math., 1998)

Algorithms for Categorical Equivalence. - Clifford Bergman; Joel Berman (Math. Struct. Comput. Sci., 1998)

Counting Finite Algebras in the Post Varieties. - Joel Berman; Pawel M. Idziak (Int. J. Algebra Comput., 2000)

Irreducible elements and uniquely generated algebras. - Joel Berman; Gabriela Hauser Bordalo (Discret. Math., 2002)

Free Lukasiewicz and Hoop Residuation Algebras. - Joel Berman; Willem J. Blok (Stud Logica, 2004)

Algebras Defined from Ordered Sets and the Varieties they Generate. - Joel Berman; Willem J. Blok (Order, 2006)

In Memory of Willem Johannes Blok 1947-2003. - Joel Berman; Wieslaw Dziobiak; Don Pigozzi; James G. Raftery 001 (Stud Logica, 2006)

Maximal n-generated subdirect products. - Joel Berman (Int. J. Algebra Comput., 2016)