Computational Complexity of the Word Problem in Modal and Heyting Algebras with a Small Number of Generators
Crossref DOI link: https://doi.org/10.3103/S1066369X22050061
Published Online: 2022-12-26
Published Print: 2022-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Rybakov, M.
Text and Data Mining valid from 2022-05-01
Version of Record valid from 2022-05-01
Article History
Received: 25 July 2021
Revised: 21 August 2021
Accepted: 29 September 2022
First Online: 26 December 2022
CONFLICT OF INTEREST
: The author declares that he has no conflicts of interest.