Access the full text.
Sign up today, get DeepDyve free for 14 days.
F. Esteva, L. Godo (2001)
Monoidal t-norm based logic: towards a logic for left-continuous t-normsFuzzy Sets Syst., 124
S. Aguzzoli, M. Busaniche, V. Marra (2007)
Spectral duality for finitely generated Nilpotent Minimum algebras, with applicationsJ. Log. Comput., 17
M. Baaz, N. Preining, R. Zach (2007)
First-order Gödel logicsAnn. Pure. Appl. Log., 147
P. Cintula, P. Hájek (2010)
Triangular norm predicate fuzzy logicsFuzzy Sets Syst., 161
P. Hájek (2010)
Arithmetical complexity of fuzzy predicate logics—a survey IIAnn. Pure Appl. Log., 161
S. Aguzzoli, B. Gerla (2010)
Probability measures in the logic of Nilpotent MinimumStud. Log., 94
P. Hájek (2010)
On witnessed models in fuzzy logic III—witnessed Gödel logicsMath. Log. Q., 56
P. Hájek (2005)
Non-arithmetical Gödel logicLog. J. IGPL, 13
J.M. Dunn, R.K. Meyer (1971)
Algebraic completeness results for Dummett’s LC and its extensionsMath. Log. Q., 17
R. Cignoli, P. Torrens (2006)
Free algebras in varieties of Glivenko MTL-algebras satisfying the equation 2(x 2) = (2x)2Stud. Log., 83
M. Busaniche, R. Cignoli (2010)
Constructive logic with strong negation as a substructural logicJ. Log. Comput., 20
M. El-Zekey, W. Lotfallah, N. Morsi (2009)
Computational complexities of axiomatic extensions of monoidal t-norm based logicSoft Comput., 13
F. Esteva, L. Godo, C. Noguera (2010)
On expansions of WNM t-norm based logics with truth-constantsFuzzy Sets Syst., 161
F. Esteva, L. Godo, C. Noguera (2006)
On rational weak Nilpotent minimum logicsJ. Mult. Valued Log. Soft Comput., 12
M. Busaniche (2006)
Free Nilpotent Minimum algebrasMath. Log. Q., 52
M. Dummett (1959)
A propositional calculus with denumerable matrixJ. Symb. Log., 24
F. Esteva, L. Godo, C. Noguera (2010)
Expanding the propositional logic of a t-norm with truth-constants: completeness results for rational semanticsSoft Comput., 14
S. Jenei (2003)
On the structure of rotation-invariant semigroupsArch. Math. Log., 42
Inspired by the work done by Baaz et al. (Ann Pure Appl Log 147(1–2): 23–47, 2007; Lecture Notes in Computer Science, vol 4790/2007, pp 77–91, 2007) for first-order Gödel logics, we investigate 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, establishing also 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.
Archive for Mathematical Logic – Springer Journals
Published: Jan 23, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.