Commutative, integral and bounded GBL-algebras form a subvariety of residuated lattices which provides the algebraic semantics of an interesting common fragment of intuitionistic logic and of several fuzzy logics. It is known that both the equational theory and the quasiequational theory of commutative GBL-algebras are decidable (in contrast to the noncommutative case), but their complexity has not been studied yet. In this paper, we prove that both theories are in PSPACE, and that the quasiequational theory is PSPACE-hard.
Scheda prodotto non validato
Scheda prodotto in fase di analisi da parte dello staff di validazione
|Titolo:||The Consequence Relation in the Logic of Commutative GBL-Algebras is PSPACE-complete.|
|Rivista:||THEORETICAL COMPUTER SCIENCE|
|Citazione:||Bova, S., & Montagna, F. (2009). The Consequence Relation in the Logic of Commutative GBL-Algebras is PSPACE-complete. THEORETICAL COMPUTER SCIENCE, 410, 1143-1158.|
|Appare nelle tipologie:||1.1 Articolo in rivista|