On Strong Structural Completeness of Varieties and Quasivarieties

Alex Citkin
(Metropolitan Telecommunications, NewYork USA)

We study structural completeness in the infinitary sense (strong structural completeness) in an algebraic setting. A variety is structurally complete (SCpl) if it is generated, as a quasivariety, by its free algebras, and it is strongly structurally complete (SSCpl) if it is generated, as a prevariety, by its free algebras. A quasivariety is SSCpl if it is generated, as a prevariety, by its free algebras.

We prove that every quasivariety of finite type with the CEP that is generated by finite algebras and contains an infinite irreducible algebra is not SSCpl. Moreover, every congruence meet-semidistributive variety of finite type generated by finite algebras is SSCpl if and only if it is tabular. Thus, Dummett's and Medvedev's logics are SCpl but not SSCpl.

A variety is primitive if it is SCpl and all its subvarieties are SCpl; it is strongly primitive if it is SSCpl and all its subvarieties are SSCpl. We prove that in primitive congruence-distributive varieties of finite type, the tabular subvarieties, and only those, are strongly primitive. This observation also yields a criterion for strong primitivity.

In Marta Bílková, Malvin Gattinger, Iris van der Giessen, Marianna Girlando and Yanjing Wang: Proceedings of the Sixteenth International Conference on Advances in Modal Logic (AiML 2026), Amsterdam, The Netherlands, 29-06-2026, Electronic Proceedings in Theoretical Computer Science 447, pp. 262–277.
Published: 29th June 2026.

ArXived at: https://dx.doi.org/10.4204/EPTCS.447.15 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org