Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Fuzzy-set based logics-an history-oriented presentation of their main developments.
The representation of human-originated information and the formalization of commonsense
reasoning has motivated different schools of research in Artificial or Computational …
reasoning has motivated different schools of research in Artificial or Computational …
On derivations and their fixed point sets in residuated lattices
P He, X **n, J Zhan - Fuzzy Sets and Systems, 2016 - Elsevier
The main goal of this paper is to investigate derivations in residuated lattices and
characterize some special types of residuated lattices in terms of derivations. In the paper …
characterize some special types of residuated lattices in terms of derivations. In the paper …
Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL
Substructural logics have received a lot of attention in recent years from the communities of
both logic and algebra. We discuss the algebraization of substructural logics over the full …
both logic and algebra. We discuss the algebraization of substructural logics over the full …
[PDF][PDF] Classes of residuated lattices
LC Ciungu - Annals of the University of Craiova-Mathematics and …, 2006 - inf.ucv.ro
The commutative residuated lattices were first introduced by M. Ward and RP Dilworth as
generalization of ideal lattices of rings. Non-commutative residuated lattices, called …
generalization of ideal lattices of rings. Non-commutative residuated lattices, called …
Prime, minimal prime and maximal ideals spaces in residuated lattices
D Piciu - Fuzzy Sets and Systems, 2021 - Elsevier
In this paper, the notion of minimal prime ideal is introduced in residuated lattices and
related properties are investigated. Also, new equivalent characterizations and properties for …
related properties are investigated. Also, new equivalent characterizations and properties for …
Constructive logic with strong negation is a substructural logic. I
M Spinks, R Veroff - Studia Logica, 2008 - Springer
The goal of this two-part series of papers is to show that constructive logic with strong
negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the …
negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the …
On state residuated lattices
P He, X **n, Y Yang - Soft Computing, 2015 - Springer
In the paper, we introduce the notion of state operators on residuated lattices and investigate
some related properties of such operators. Also, we give characterizations of Rl-monoids …
some related properties of such operators. Also, we give characterizations of Rl-monoids …
Constructive logic with strong negation as a substructural logic
M Busaniche, R Cignoli - Journal of Logic and Computation, 2010 - academic.oup.com
Spinks and Veroff have shown that constructive logic with strong negation (CLSN for short),
can be considered as a substructural logic. We use algebraic tools developed to study …
can be considered as a substructural logic. We use algebraic tools developed to study …
Glivenko like theorems in natural expansions of BCK‐logic
R Cignoli, A Torrens Torrell - Mathematical Logic Quarterly …, 2004 - Wiley Online Library
The classical Glivenko theorem asserts that a propositional formula admits a classical proof
if and only if its double negation admits an intuitionistic proof. By a natural expansion of the …
if and only if its double negation admits an intuitionistic proof. By a natural expansion of the …
Free Algebras in Varieties of Glivenko MTL-algebras Satisfying the Equation 2(x2) = (2x)2
R Cignoli, AT Torrell - Studia Logica, 2006 - Springer
The aim of this paper is to give a description of the free algebras in some varieties of
Glivenko MTL-algebras having the Boolean retraction property. This description is given …
Glivenko MTL-algebras having the Boolean retraction property. This description is given …