Provability in predicate product logic

From MaRDI portal





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.











This page was built for publication: Provability in predicate product logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884950)