First-order nilpotent minimum logics: first steps

From MaRDI portal
Publication:2377356



Abstract: Following the lines of the analysis done in [BPZ07, BCF07] for first-order G"odel logics, we present an analogous investigation for Nilpotent Minimum logic NM. We study decidability and reciprocal inclusion of various sets of first-order tautologies of some subalgebras of the standard Nilpotent Minimum algebra. We establish a connection between the validity in an NM-chain of certain first-order formulas and its order type. Furthermore, we analyze axiomatizability, undecidability and the monadic fragments.


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.



Cites work









This page was built for publication: First-order nilpotent minimum logics: first steps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377356)