The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete

DOI10.1016/j.tcs.2008.10.024zbMath1159.03045OpenAlexW2076019293MaRDI QIDQ1006641

Simone Bova, Franco Montagna

Publication date: 25 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.024

zbMATH Keywords

computational complexityfuzzy logicsubstructural logicsintuitionistic logicresiduated latticescommutative GBL-algebras

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Complexity of computation (including implicit computational complexity) (03D15) Other algebras related to logic (03G25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Ordered semigroups and monoids (06F05)

Related Items (7)

Franco Montagna's work on provability logic and many-valued logic ⋮ Obituary: Franco Montagna (1948--2015) ⋮ A Kripke Semantics for Hajek's BL ⋮ Some modal and temporal translations of generalized basic logic ⋮ Kripke semantics for intuitionistic Łukasiewicz logic ⋮ Double negation semantics for generalisations of Heyting algebras ⋮ Soft Constraints Processing over Divisible Residuated Lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity issues in Basic Logic
• On the structure of generalized BL-algebras
• Residuated lattices. An algebraic glimpse at substructural logics
• Embedding theorems for classes of GBL-algebras
• Retracted: Ordered groups with a modality
• The complexity of the word problem for abelian l-groups
• Satisfiability in many-valued sentential logic is NP-complete
• An algebraic approach to non-classical logics
• Intuitionistic propositional logic is polynomial-space complete
• Metamathematics of fuzzy logic
• Generalized MV-algebras
• On the structure of hoops
• The Blok-Ferreirim theorem for normal GBL-algebras and its application
• Algebraizable logics
• A theorem about infinite-valued sentential logic
• Complexity of t-tautologies

This page was built for publication: The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete