First-order nilpotent minimum logics: first steps (Q2377356): Difference between revisions

Nilpotent minimum logic is a t-norm-based logic obtained as an extension of MTL. It shares some common features with Gödel logic, i.e., intuitionistic logic plus prelinearity. In this paper the author investigates some aspects of first-order nilpotent minimum logic starting from analogous results for first-order Gödel logic. He notes that there are several infinite-valued first-order nilpotent minimum logics, and he focuses on four particular cases given by considering different (linearly ordered) algebras of truth-values. He also investigates the finite-valued case. Then, completeness is proved for the finite-valued case, while for the considered infinite-valued logics it is proved that the set of first-order tautologies is not recursively axiomatizable. Generalizing results for Gödel logic, also the monadic case is investigated.