Complexity of some language fragments of fuzzy logics
From MaRDI portal
Publication:1699732
DOI10.1007/S00500-016-2346-0zbMath1392.03036OpenAlexW2529116197MaRDI QIDQ1699732
Publication date: 23 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-016-2346-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjunction property and complexity of substructural logics
- Varieties generated by t-norms
- Residuated lattices. An algebraic glimpse at substructural logics
- Satisfiability in many-valued sentential logic is NP-complete
- Intuitionistic propositional logic is polynomial-space complete
- Metamathematics of fuzzy logic
- Hájek basic fuzzy logic and Łukasiewicz infinite-valued logic
- The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
- Varieties of BL-algebras. I: General properties.
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Canonical formulas for \(k\)-potent commutative, integral, residuated lattices
- Free algebras in varieties of Glivenko MTL-algebras satisfying the equation \(2(x^{2}) = (2x)^{2}\)
- Basic hoops: an algebraic study of continuous t-norms
- Formal systems of fuzzy logic and their fragments
- Bases for equational theories of semi-groups
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic
- Algebraic Structures with Hard Equivalence and Minimization Problems
- Super-Łukasiewicz implicational logics
- Varieties of Commutative Semigroups
- Hoops and Fuzzy Logic
- Certain Method for Generating a Series of Logics
- The Lattice of Equational Classes of Commutative Semigroups
- Complexity of t-tautologies
This page was built for publication: Complexity of some language fragments of fuzzy logics