Provability in predicate product logic
The paper extends the theory of BL-logics introduced by \textit{P. Hájek} in 1998, exploiting the connection of the cancellative conjunctions on BL-algebras with ordered abelian groups. Then a sentence is provable if and only if it is a tautology (completeness). Moreover, closed models and the lexicographic sums are discussed and the completeness of BL-chains which are initially dense (or which are not initially dense) is studied.
scientific article; zbMATH DE number 5162353
scientific article