A Non-finitary Sentential Logic that is Elementarily Algebraizable
James Raftery · Journal of Logic and Computation · 2008
We exhibit a non-finitary sentential logic that is algebraized by a quasivariety—in fact by a finitely based variety of finite type. The algebraization process requires infinitely many defining equations. The existence of such a logic settles a question posed in Czelakowski (2001, Protoalgebraic Logics) and implicit in Herrmann (1996, Studia Logica, 57, 419–436).