On the complexity of validity degrees in Łukasiewicz logic
From MaRDI portal
Publication:2106603
DOI10.1007/978-3-030-51466-2_15OpenAlexW3037675099MaRDI QIDQ2106603
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_15
Related Items (2)
Rational Pavelka logic: the best among three worlds? ⋮ Structural completeness in many-valued logics with rational constants
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras
- Advanced Łukasiewicz calculus and MV-algebras
- Mapping Abelian \(\ell\)-groups with strong unit one-one into MV algebras
- Satisfiability in many-valued sentential logic is NP-complete
- The complexity of optimization problems
- Resolution and model building in the infinite-valued calculus of Łukasiewicz
- Metamathematics of fuzzy logic
- A note on axiomatizations of Pavelka-style complete fuzzy logics
- Algebraic foundations of many-valued reasoning
- Finiteness in infinite-valued Łukasiewicz logic
- Pavelka-style fuzzy logic in retrospect and prospect
- Implicit definability of truth constants in Łukasiewicz logic
- Computational complexity of t-norm based propositional fuzzy logics with rational truth constants
- An asymptotically tight bound on countermodels for Łukasiewicz logic
- The logic of inexact concepts
- Admissible Rules of Lukasiewicz Logic
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic
- Algebraizable logics
- On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
- Cyclic Elements in MV‐Algebras and Post Algebras
- Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic
- The complexity of admissible rules of Lukasiewicz logic
- A theorem about infinite-valued sentential logic
This page was built for publication: On the complexity of validity degrees in Łukasiewicz logic
