Pages that link to "Item:Q3623218"
From MaRDI portal
The following pages link to Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic (Q3623218):
Displaying 15 items.
- Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras (Q278739) (← links)
- Finite axiomatizability in Łukasiewicz logic (Q716501) (← links)
- Complexity issues in Basic Logic (Q816857) (← links)
- The coherence of Łukasiewicz assessments is NP-complete (Q985139) (← links)
- Arithmetical complexity of fuzzy predicate logics -- a survey. II. (Q1035656) (← links)
- Complexity of some language fragments of fuzzy logics (Q1699732) (← links)
- On the complexity of validity degrees in Łukasiewicz logic (Q2106603) (← links)
- Triangular norm based predicate fuzzy logics (Q2270233) (← links)
- A note on minimal axiomatisations of some extensions of MTL (Q2350487) (← links)
- Computational complexities of axiomatic extensions of monoidal t-norm based logic (Q2391235) (← links)
- An asymptotically tight bound on countermodels for Łukasiewicz logic (Q2506811) (← links)
- Computational complexity of infinite-valued Łukasiewicz propositional logic (Q2784792) (← links)
- Chang's Ł<sup>*</sup>Logic (Q4656548) (← links)
- The complexity of admissible rules of Lukasiewicz logic (Q5300587) (← links)
- Introduction (Q5892200) (← links)