2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/172540We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.Logic in Computer ScienceOn Finite Bases for Weak Semantics: Failures versus Impossible Futurestext