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

DOI10.1016/J.TCS.2008.10.024MaRDI QIDQ1006641zbMATH OpenOpenAlexFDO

Authors 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 complexityintuitionistic logicsubstructural logicsfuzzy logicresiduated latticescommutative GBL-algebras

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of the equational theory of residuated Boolean algebras
• The Blok-Ferreirim theorem for normal GBL-algebras and its application
• Algebras of Relations and Relevance Logic
• Multipotent GBL-algebras
• On the structure of generalized BL-algebras

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 960150 (Why is no real title available?)
• A theorem about infinite-valued sentential logic
• Algebraizable logics
• An algebraic approach to non-classical logics
• Complexity issues in Basic Logic
• Complexity of t-tautologies
• Embedding theorems for classes of GBL-algebras
• Generalized MV-algebras
• Introduction to algorithms
• Intuitionistic propositional logic is polynomial-space complete
• Metamathematics of fuzzy logic
• On the structure of generalized BL-algebras
• On the structure of hoops
• Residuated lattices. An algebraic glimpse at substructural logics
• Retracted: Ordered groups with a modality
• Satisfiability in many-valued sentential logic is NP-complete
• The Blok-Ferreirim theorem for normal GBL-algebras and its application
• The complexity of the word problem for abelian l-groups

Cited in

(9)

• Soft Constraints Processing over Divisible Residuated Lattices
• On the complexity of the equational theory of residuated Boolean algebras
• Kripke semantics for intuitionistic Łukasiewicz logic
• Double negation semantics for generalisations of Heyting algebras
• A Kripke Semantics for Hajek's BL
• Obituary: Franco Montagna (1948--2015)
• The Blok-Ferreirim theorem for normal GBL-algebras and its application
• Some modal and temporal translations of generalized basic logic
• Franco Montagna's work on provability logic and many-valued logic

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

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