Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras
From MaRDI portal
Publication:278739
DOI10.1016/j.tcs.2016.03.009zbMath1418.03193arXiv1501.02250OpenAlexW1519689289MaRDI QIDQ278739
Publication date: 2 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.02250
computational complexitysubstructural logicMV-algebrasatisfiability\(\mathrm{FL}_{\mathrm{ew}}\)-algebra
Analysis of algorithms and problem complexity (68Q25) Other algebras related to logic (03G25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Related Items (3)
Rational Pavelka logic: the best among three worlds? ⋮ Implicit definability of truth constants in Łukasiewicz logic ⋮ On the complexity of validity degrees in Łukasiewicz logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
- On the structure of semi-groups on a compact manifold with boundary
- Residuated lattices. An algebraic glimpse at substructural logics
- Satisfiability in many-valued sentential logic is NP-complete
- Metamathematics of fuzzy logic
- Monoidal t-norm based logic: Towards a logic for left-continuous t-norms
- Hájek basic fuzzy logic and Łukasiewicz infinite-valued logic
- Expanding basic fuzzy logic with truth constants for component delimiters
- Algebraic foundations of many-valued reasoning
- MV-algebras: a variety for magnitudes with archimedean units
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic
- Super-Łukasiewicz propositional logics
- Glivenko like theorems in natural expansions of BCK-logic
- The complexity of theorem-proving procedures
- Residuated Lattices
This page was built for publication: Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras
