The intuitionistic propositional calculus with quantifiers

Let L be the language of the intuitionistic propositional calculus J completed by the quantifiers and , and let calculus 2J in language L contain, besides the axioms of J, the axioms xB (x) B(y) and B(y) xB (x). A Kripke semantics is constructed for 2J and a completeness theorem is proven. A result of D. Gabbay is generalized concerning the undecidability of C2J⁺-extension of 2J by schemes x (x B) and x(A B(x))A xB (x) specificially: the undecidability is proven of each T theory in language L such that [2J]T [C2J+] ([2J] ([2J] denotes the set of all theorems of calculus 2J).Translated from Matematicheskie Zametki, Vol. 22, No. 1, pp. 69–76, July, 1977.     

Complexity of subclasses of the intuitionistic propositional calculus

We investigate the complexity of the decision problem for subclasses of the intuitionistic propositional calculus and present upper bounds for decision procedures locating these subclasses into lower complexity classes like co-NP or polynomial time.     

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.     

Sequent calculus proof theory of intuitionistic apartness and order relations

Contraction-free sequent calculi for intuitionistic theories of apartness and order are given and cut-elimination for the calculi proved. Among the consequences of the result is the disjunction property for these theories. Through methods of proof analysis and permutation of rules, we establish conservativity of the theory of apartness over the theory of equality defined as the negation of apartness, for sequents in which all atomic formulas appear negated. The proof extends to conservativity results for the theories of constructive order over the usual theories of order. Received: 4 December 1997     

Extension principles for interval-valued intuitionistic fuzzy sets and algebraic operations

The Atanassov’s intuitionistic fuzzy (IF) set theory has become a popular topic of investigation in the fuzzy set community. However, there is less investigation on the representation of level sets and extension principles for interval-valued intuitionistic fuzzy (IVIF) sets as well as algebraic operations. In this paper, firstly the representation theorem of IVIF sets is proposed by using the concept of level sets. Then, the extension principles of IVIF sets are developed based on the representation theorem. Finally, the addition, subtraction, multiplication and division operations over IVIF sets are defined based on the extension principle. The representation theorem and extension principles as well as algebraic operations form an important part of Atanassov’s IF set theory.     

Exponential operations for intuitionistic fuzzy numbers and interval numbers in multi-attribute decision making

Intuitionistic fuzzy numbers (IFNs) have already been applied to many fields, especially in multi-attribute decision making (MADM). Based on the basic operational laws and information aggregation methods of IFNs, MADM with intuitionistic fuzzy information has become more and more popular. In this paper, we investigate the MADM problems where the attribute values take the form of interval numbers and the weight information on the attributes are expressed as IFNs. We first propose a novel exponential operational law based on IFNs and interval numbers, and then study some of its desirable properties. Based on the exponential operational law, we put forward an intuitionistic fuzzy weighted exponential aggregation operator, and utilize it to develop a MADM method. Finally, we apply our method to solve the decision making problem under uncertainty.     

Limit properties and derivative operations in the metric space of intuitionistic fuzzy numbers

Intuitionistic fuzzy numbers (IFNs) are a useful tool to depict the uncertain information in real life. Based on IFNs, the intuitionistic fuzzy calculus (IFC) has been put forward recently. To further develop the IFC theory, in this paper, we investigate the limit properties of IFCs, and study the intuitionistic fuzzy infinitesimals and their orders. We also discuss the continuity, the derivatives and the differentials of intuitionistic fuzzy functions in detail, and reveal their relationships. Additionally, we define the metric space of the IFNs, based on which, a series of desirable results are obtained. These results are similar to the ones in the classical calculus.     

A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice

Moscow. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 29, No. 1, pp. 171–178, January–February, 1988.     

Comments on some versions of intuitionistic fuzzy propositional calculus due to K. Atanassov and G. Gargov

We show that the versions of intuitionistic fuzzy propositional calculus given in Definitions 6 and 7 in Atanassov and Gargov (Fuzzy Sets and Systems 95 (1998) 39–52) do not satisfy modus ponens. Furthermore, we show that the version of intuitionistic fuzzy propositional calculus given in Definition 8 by Atanassov and Gargov is incorrect.     

New results in subdifferential calculus with applications to convex optimization

Chain and addition rules of subdifferential calculus are revisited in the paper and new proofs, providing local necessary and sufficient conditions for their validity, are presented. A new product rule pertaining to the composition of a convex functional and a Young function is also established and applied to obtain a proof of Kuhn-Tucker conditions in convex optimization under minimal assumptions on the data. Applications to plasticity theory are briefly outlined in the concluding remarks.The financial support of the Italian Ministry for University and Scientific and Technological Research is gratefully acknowledged.     

New operations over hesitant fuzzy sets

Hesitant fuzzy sets are considered to be the way to characterize vague phenomenon. Their study has opened a new area of research and applications. Set operations on them lead to a number of properties of these sets which are not evident in classical (crisp) sets make the area mathematically also very productive. Since these sets are defined in terms of functions and set of functions, which is not the case when the sets are crisp, it is possible to define several set operations. Such a study enriches the use of these sets. In this paper, four new operations are envisaged, defined and taken up to study a score of new identities on hesitant fuzzy sets.     

Derivation of intuitionistic fuzzy weights based on intuitionistic fuzzy preference relations

This paper proposes linear goal programming models for deriving intuitionistic fuzzy weights from intuitionistic fuzzy preference relations. Novel definitions are put forward to define additive consistency and weak transitivity for intuitionistic fuzzy preference relations, followed by a study of their corresponding properties. For any given normalized intuitionistic fuzzy weight vector, a transformation formula is furnished to convert the weights into a consistent intuitionistic fuzzy preference relation. For any intuitionistic fuzzy preference relation, a linear goal programming model is developed to obtain its intuitionistic fuzzy weights by minimizing its deviation from the converted consistent intuitionistic fuzzy preference relation. This approach is then extended to group decision-making situations. Three numerical examples are provided to illustrate the validity and applicability of the proposed models.     

Answer set programming in intuitionistic logic

As a demonstration of the flexibility of constructive mathematics, we propose an interpretation of propositional answer set programming (ASP) in terms of intuitionistic proof theory, in particular in terms of simply typed lambda calculus. While connections between ASP and intuitionistic logic are well-known, they usually take the form of characterizations of stable models with the help of some intuitionistic theories represented by specific classes of Kripke models. As such the known results are model-theoretic rather than proof-theoretic. In contrast, we offer an explanation of ASP using constructive proofs.     

Transfer principles in nonstandard intuitionistic arithmetic

 Using a slight generalization, due to Palmgren, of sheaf semantics, we present a term-model construction that assigns a model to any first-order intuitionistic theory. A modification of this construction then assigns a nonstandard model to any theory of arithmetic, enabling us to reproduce conservation results of Moerdijk and Palmgren for nonstandard Heyting arithmetic. Internalizing the construction allows us to strengthen these results with additional transfer rules; we then show that even trivial transfer axioms or minor strengthenings of these rules destroy conservativity over HA. The analysis also shows that nonstandard HA has neither the disjunction property nor the explicit definability property. Finally, careful attention to the complexity of our definitions allows us to show that a certain weak fragment of intuitionistic nonstandard arithmetic is conservative over primitive recursive arithmetic. Received: 7 January 2000 / Revised version: 26 March 2001 / Published online: 12 July 2002