Notes on strong completeness in Lukasiewicz, product and BL logics and in their first-order extensions

12Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we investigate the problem of characterizing infinite consequence relation in standard BL-algebras by the adding of new rules. First of all, we note that finitary rules do not help, therefore we need at least one infinitary rule. In fact we show that one infinitary rule is sufficient to obtain strong standard completeness, also in the first-order case. Similar results are obtained for product logic and for Lukasiewicz logic. Finally, we show some applications of our results to probabilistic logic over many-valued events and to first-order many-valued logic. In particular, we show a tight bound to the complexity of BL first-order formulas which are valid in the standard semantics. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Montagna, F. (2007). Notes on strong completeness in Lukasiewicz, product and BL logics and in their first-order extensions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4460 LNAI, pp. 247–274). Springer Verlag. https://doi.org/10.1007/978-3-540-75939-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free