✦ LIBER ✦

Computational complexities of axiomatic extensions of monoidal t-norm based logic

✍ Scribed by Moataz Saleh El-Zekey; Wafik Boulos Lotfallah; Nehad Nashaat Morsi

Publisher: Springer
Year: 2008
Tongue: English
Weight: 399 KB
Volume: 13
Category: Article
ISSN: 1432-7643
DOI: 10.1007/s00500-008-0382-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Axiomatizations of t-norm based logics –

Axiomatizations of t-norm based logics – A survey

✍ S. Gottwald 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 88 KB

On triangular norm based axiomatic exten

On triangular norm based axiomatic extensions of the weak nilpotent minimum logic

✍ Carles Noguera; Francesc Esteva; Joan Gispert 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB 👁 1 views

## Abstract In this paper we carry out an algebraic investigation of the weak nilpotent minimum logic (WNM) and its t‐norm based axiomatic extensions. We consider the algebraic counterpart of WNM, the variety of WNM‐algebras (𝕎ℕ𝕄) and prove that it is locally finite, so all its subvarieties are gen