The chain and substitution rules of interval-valued intuitionistic fuzzy calculus

The interval-valued intuitionistic fuzzy set proposed by Atanassov is the extension of intuitionistic fuzzy set. It extends the membership degree and non-membership to interval values instead of a single value. So it contains more possible values and maybe more considerate. Among all the researches, the exploration on the calculus of interval-valued intuitionistic fuzzy set is entirely new. Recently, Zhao et al. (Int J Comput Intell Syst 9:36–56, 2016) proposed the concept of interval-valued intuitionistic fuzzy function (IVIFF) and gave a calculation method of derivative and differential of IVIFF. Based on this work, in this paper, firstly, we utilize a new and easier method to express the derivative and differential of IVIFF. Secondly, we propose the chain rules of derivative and the form invariance of differential in the interval-valued intuitionistic fuzzy environment. In addition, some properties of the substation rules for interval-valued intuitionistic fuzzy indefinite integrals and definite integrals are also developed.     

区间值直觉模糊超子群

在K.Atanassov引进区间值直觉模糊集的基础上,给出了区间值直觉模糊超子群的定义,刻画了其特征结构,研究了这类区间值直觉模糊超群的同态像及原像等问题.同时,讨论了区间值直觉模糊超子群与区间值直觉模糊子群的关系.     

直觉模糊集的扩张运算

在 K.Atanassov引进直觉模糊集概念的基础上 ,首先给出乘积的定义和扩张原理 ,并讨论群上的直觉模糊集的并、交等扩张运算 ;其次在两个经典群同态、同构的条件下 ,研究直觉模糊集乘积的扩张运算问题。     

Some similarity measures of intuitionistic fuzzy sets and their applications to multiple attribute decision making

Atanassov (1986) defined the notion of intuitionistic fuzzy set, which is a generalization of the notion of Zadeh’ fuzzy set. In this paper, we first develop some similarity measures of intuitionistic fuzzy sets. Then, we define the notions of positive ideal intuitionistic fuzzy set and negative ideal intuitionistic fuzzy set. Finally, we apply the similarity measures to multiple attribute decision making under intuitionistic fuzzy environment.     

Fixed points in intuitionistic fuzzy metric spaces

The purpose of this paper, using the idea of intuitionistic fuzzy set due to Atanassov [Atanassov K. Intuitionistic fuzzy sets. Fuzzy Sets Syst 1986;20:87–96], we define the notion of intuitionistic fuzzy metric spaces due to Kramosil and Michalek [Kramosil O, Michalek J. Fuzzy metric and statistical metric spaces. Kybernetika 1975;11:326–34]. Further the well-known fixed point theorems of Banach and Edelstein are extended to intuitionistic fuzzy metric spaces with the help of Grabiec [Grabiec M. Fixed points in fuzzy metric spaces. Fuzzy Sets Syst 1988;27:385–9].     

关于IVIFS算子与IFS算子关系的讨论

Atanassov教授在给出区间教直觉模糊集算子的定义以后曾给出断语:直觉模糊集算子满足的结论,都可以推广到相应的区问数直党模糊集算子.本文详细分析多条直觉模糊集算子的性质与相应区间数直党模糊集算子的性质之间的关系,证明这些直觉模糊集算子的性质都不能推广到区间数直党模糊集算子,因而对Atanassov的论断进行了澄清.     

Common fixed point theorems in intuitionistic fuzzy metric spaces

The purpose of this paper, using the idea of intuitionistic fuzzy set due to Atanassov [2], we define the notion of intuitionistic fuzzy metric spaces (see, [1]) due to Kramosil and Michalek [17] and Jungck’s common fixed point theorem ([11]) is generalized to intuitionistic fuzzy metric spaces. Further, we first formulate the definition of weakly commuting and R-weakly commuting mappings in intuitionistic fuzzy metric spaces and prove the intuitionistic fuzzy version of Pant’s theorem ([21]).     

Intuitionistic Fuzzy Logic Control for Heater Fans

The concept of intuitionistic fuzzy systems, including intuitionistic fuzzy sets and intuitionistic fuzzy logic, was introduced by Atanassov as a generalization of fuzzy systems. Intuitionistic fuzzy systems provide a mechanism for communication between computing systems and humans. In this paper, we describe the development of an intuitionistic fuzzy logic controller for heater fans, developed on the basis of intuitionistic fuzzy systems. Intuitionistic fuzzy inference systems and defuzzification techniques are used to obtain crisp output (i.e., speed of the heater fan) from an intuitionistic fuzzy input (i.e., ambient temperature). The speed of the heater fan is calculated using intuitionistic fuzzy rules applied in an inference engine using defuzzification methods.     

Intuitionistic fuzzy metric spaces

Using the idea of intuitionistic fuzzy set due to Atanassov [Intuitionistic fuzzy sets. in: V. Sgurev (Ed.), VII ITKR's Session, Sofia June, 1983; Fuzzy Sets Syst. 20 (1986) 87], we define the notion of intuitionistic fuzzy metric spaces as a natural generalization of fuzzy metric spaces due to George and Veeramani [Fuzzy Sets Syst. 64 (1994) 395] and prove some known results of metric spaces including Baire's theorem and the Uniform limit theorem for intuitionistic fuzzy metric spaces.     

关于三角模的直觉模糊群及其同态像

本文在K．Atanassov引进的直觉模糊集概念的基础上,利用T模和S模,定义了两个直觉模糊集的乘积．给出了关于三角模的直觉模糊群的概念及其等价命题,最后在两个经典群同态与同构意义下,研究了这种直觉模糊群的同态像及原像等问题。     

直觉模糊群与它的同态像

在Ｋ,Ａｔａｎａｓｓｏｖ引进直觉模糊集的基础上,给出它的扩展原理,进而定义了直觉模糊群,并讨论了它的简单性质,最后在两个经典群同态与同构意义下,研究了这咱直觉模糊群的像、前像与逆映射等问题。     

$M$-半群的直觉$(S,T)$-模糊$M$-子半群的性质

K.T.Atanassov在1986年首先引入直觉模糊集的概念,本文利用s-范数和t-范数,引入M-半群的直觉(S,T)-模糊M-子半群的概念,刻画其性质和特征,我们再进一步给出了直觉(S,T)-直积的概念,并由此探讨了一些有意义的相关结论。     

Sequent calculi for propositional star-free likelihood logic

We consider classical, multisuccedent intuitionistic, and intuitionistic sequent calculi for propositional likelihood logic. We prove the admissibility of structural rules and cut rule, invertibility of rules, correctness of the calculi, and completeness of the classical calculus with respect to given semantics.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 1, pp. 3–21, January–March, 2005.     

直觉模糊集运算性质

针对Atanassov(Intuitionistic Fuzzy Sets. Heidelberg: Springer,1999)给出的直觉模糊集运算,指出并修正一些直觉模糊集运算的错误性质,这将有利于对直觉模糊集的进一步研究.     

New operations in intuitionistic calculus

The question is studied of the possibility of extending the intuitionistic propositional calculus by adding single-valued one-place operations which are not expressible in terms of conjunction, disjunction, implication, or negation. There is constructed a system of correct calculi with new single-valued operations which is isomorphic to the family of proper extensions of the intuitionistic propositional calculus.Translated from Matematicheskie Zametki, Vol. 22, No. 1, pp. 23–28, July, 1977.The author wishes to thank L. L. Maksimova for his help with this paper.     

关于区间值直觉模糊集运算性质的注记

针对Atanassov[3]给出的区间值直觉模糊集运算,指出并修正一些区间值模糊集运算的错误性质,有利于以区间值直觉模糊集的进一步研究。     

A proof-search procedure for intuitionistic propositional logic

A sequent root-first proof-search procedure for intuitionistic propositional logic is presented. The procedure is obtained from modified intuitionistic multi-succedent and classical sequent calculi, making use of Glivenko’s Theorem. We prove that a sequent is derivable in a standard intuitionistic multi-succedent calculus if and only if the corresponding prefixed-sequent is derivable in the procedure.     

Uniform interpolation and the existence of sequent calculi

This paper presents a uniform and modular method to prove uniform interpolation for several intermediate and intuitionistic modal logics. The proof-theoretic method uses sequent calculi that are extensions of the terminating sequent calculus $\mathsf{G4ip}$ for intuitionistic propositional logic. It is shown that whenever the rules in a calculus satisfy certain structural properties, the corresponding logic has uniform interpolation. It follows that the intuitionistic versions of $\mathsf{K}$ and $\mathsf{KD}$ (without the diamond operator) have uniform interpolation. It also follows that no intermediate or intuitionistic modal logic without uniform interpolation has a sequent calculus satisfying those structural properties, thereby establishing that except for the seven intermediate logics that have uniform interpolation, no intermediate logic has such a sequent calculus.     

An intuitionistic formula hierarchy based on high‐school identities

We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal) propositional sequent calculi are formula (i.e., sequent) isomorphisms corresponding to the high‐school identities, we show that one can obtain a more compact variant of a proof system, consisting of non‐invertible proof rules only, and where the invertible proof rules have been replaced by a formula normalization procedure. Moreover, for certain proof systems such as the G4ip sequent calculus of Vorob'ev, Hudelmaier, and Dyckhoff, it is even possible to see all of the non‐invertible proof rules as strict inequalities between exponential polynomials; a careful combinatorial treatment is given in order to establish this fact. Finally, we extend the exponential polynomial analogy to the first‐order quantifiers, showing that it gives rise to an intuitionistic hierarchy of formulas, resembling the classical arithmetical hierarchy, and the first one that classifies formulas while preserving isomorphism.     

基础模糊命题演算系统BL~*的改进系统

基础模糊命题演算系统BL*是一个和基础命题演算系统BL相对独立的命题演算系统。命题演算系统L*是系统BL*的扩张,但不是系统BL的扩张。通过对系统BL*及其它模糊命题演算系统的研究,本文对BL*系统进行了修正,进一步改进了BL*系统中的公理体系。