Explore chapters and articles related to this topic
Axiomatization of non-associative generalisations of Hájek's BL and psBL
Published in Journal of Applied Non-Classical Logics, 2020
Yaroslav Petrukhin
BL is built over a propositional language which contains a set of propositional variables, left and right parentheses, falsehood constant ⊥, conjunction &, and implication . A set of all -formulas is defined in a standard way. Besides,
An evaluation of propositional variables by elements of a BL-algebra is defined in a standard way. An evaluation e of all -formulas is defined as follows:
A formula A is an -tautology iff , for each evaluation e in . A formula A is a BL-tautology iff it is -tautology, for each BL-algebra .