Realisability for infinitary intuitionistic set theory

We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary intuitionistic logic, and that all axioms of infinitary Kripke-Platek set theory are realised. Finally, we use a variant of our notion of realisability to show that the propositional admissible rules of (finitary) intuitionistic Kripke-Platek set theory are exactly the admissible rules of intuitionistic propositional logic.     

Effectivity properties of intuitionistic set theory with collection scheme

Intuitionistic set theory with collection scheme is considered. Its various effectivity properties are proved by using the method of realizability.     

Computational adequacy for recursive types in models of intuitionistic set theory

This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. Our approach is to view such models as full subcategories of categorical models of intuitionistic set theory. It is shown that the existence of solutions to recursive domain equations depends upon the strength of the set theory. We observe that the internal set theory of an elementary topos is not strong enough to guarantee their existence. In contrast, as our first main result, we establish that solutions to recursive domain equations do exist when the category of sets is a model of full intuitionistic Zermelo–Fraenkel set theory. We then apply this result to obtain a denotational interpretation of FPC, a recursively typed lambda-calculus with call-by-value operational semantics. By exploiting the intuitionistic logic of the ambient model of intuitionistic set theory, we analyse the relationship between operational and denotational semantics. We first prove an “internal” computational adequacy theorem: the model always believes that the operational and denotational notions of termination agree. This allows us to identify, as our second main result, a necessary and sufficient condition for genuine “external” computational adequacy to hold, i.e. for the operational and denotational notions of termination to coincide in the real world. The condition is formulated as a simple property of the internal logic, related to the logical notion of 1-consistency. We provide useful sufficient conditions for establishing that the logical property holds in practice. Finally, we outline how the methods of the paper may be applied to concrete models of FPC. In doing so, we obtain computational adequacy results for an extensive range of realizability and domain-theoretic models.     

Canonical form of Tarski sets in Zermelo-Fraenkel set theory

We establish the equivalence of the notions of an inaccessible cumulative set and uncountable Tarski set. In addition, the equivalence of these notions and that of a galactic set is proved.Translated from Matematicheskie Zametki, vol. 77, no. 3, 2005, pp. 323–333.Original Russian Text Copyright © 2005 by E. I. Bunina, V. K. Zakharov.This revised version was published online in April 2005 with a corrected issue number.     

Lattice valued intuitionistic fuzzy sets

In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given. The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an lattice valued intuitionistic fuzzy set for which these are families of level sets. The research supported by Serbian Ministry of Science and Technology, Grant No. 1227.     

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.     

A cumulative hierarchy of sets for constructive set theory

The von Neumann hierarchy of sets is heavily used as a basic tool in classical set theory, being an underlying ingredient in many proofs and concepts. In constructive set theories like without the powerset axiom however, it loses much of its potency by ceasing to be a hierarchy of sets as its single stages become only classes. This article proposes an alternative cumulative hierarchy which does not have this drawback and provides examples of how it can be used to prove new theorems in .     

Some aspects of intuitionistic fuzzy sets

We first discuss the significant role that duality plays in many aggregation operations involving intuitionistic fuzzy subsets. We then consider the extension to intuitionistic fuzzy subsets of a number of ideas from standard fuzzy subsets. In particular we look at the measure of specificity. We also look at the problem of alternative selection when decision criteria satisfaction is expressed using intuitionistic fuzzy subsets. We introduce a decision paradigm called the method of least commitment. We briefly look at the problem of defuzzification of intuitionistic fuzzy subsets.     

Categorical set theory: A characterization of the category of sets

We consider Zermelo-Fraenkel set theory ZF and the theory ETS(ZF) of the elementary topos of ZF sets, which is an extension of Lawvere-Tierney's theory of elementary topoi, and prove that the theory ETS(ZF) characterizes the category (topos) of ZF-sets in the following sense. The category (topos) of ZF sets satisfies the axioms of ETS(ZF), and conversely we can define within topos theory ETS(ZF) the model of set-objects in which the ZF axiloms hold, and, furthermore, the model of set-objects in the topos of ZF sets is “equivalent” to set theory ZF and the topos of set-objects in ETS(ZF) is “logical equivalent” to topos theory ETS(ZF). Actually, the corresponding result for a weak set theory Z and the theory ETS(Z) of the elementary topos of Z sets is proved. Adding further axioms (axiom of choice, continuum hypothesis, etc.), various results of the same character are obtained.The construction of the model of set-objects uses a universal mapping property of transitive sets, which enables us to introduce transitive-set-objects in any elementary topos and to prove their basic properties.     

An intuitionistic fixed point theory

In this article we prove that a certain intuitionistic version of the well-known fixed point theory is conservative over for almost negative formulas. Received October 24, 1995     

Multicriteria decision-making method using the Dice similarity measure based on the reduct intuitionistic fuzzy sets of interval-valued intuitionistic fuzzy sets

This paper proposes the concept of the reduct intuitionistic fuzzy sets of interval-valued intuitionistic fuzzy sets (IVIFSs) with respect to adjustable weight vectors and the Dice similarity measure based on the reduct intuitionistic fuzzy sets to explore the effects of optimism, neutralism, and pessimism in decision making. Then a decision-making method with the pessimistic, optimistic, and neutral schemes desired by the decision maker is established by combining adjustable weight vectors and the Dice similarity measure for IVIFSs. The proposed decision-making method is more flexible and adjustable in practical problems and can determine the ranking order of alternatives and the optimal one(s), so that it can overcome the difficulty of the ranking order and decision making when there exist the same measure values of some alternatives in some cases. This adjustable feature can provide the decision maker with more selecting schemes and actionable results for the decision-making analysis. Finally, two illustrative examples are employed to show the feasibility of the proposed method in practical applications.     

Multi-criteria decision-making methods based on intuitionistic fuzzy sets

In this paper we present new methods for solving multi-criteria decision-making problem in an intuitionistic fuzzy environment. First, we define an evaluation function for the decision-making problem to measure the degrees to which alternatives satisfy and do not satisfy the decision-maker’s requirement. Then, we introduce and discuss the concept of intuitionistic fuzzy point operators. By using the intuitionistic fuzzy point operators, we can reduce the degree of uncertainty of the elements in a universe corresponding to an intuitionistic fuzzy set. Furthermore, a series of new score functions are defined for multi-criteria decision-making problem based on the intuitionistic fuzzy point operators and the evaluation function and their effectiveness and advantage are illustrated by examples.     

A rough set approach to intuitionistic fuzzy soft set based decision making

The soft set theory, originally proposed by Molodtsov, can be used as a general mathematical tool for dealing with uncertainty. Since its appearance, there has been some progress concerning practical applications of soft set theory, especially the use of soft sets in decision making. The intuitionistic fuzzy soft set is a combination of an intuitionistic fuzzy set and a soft set. The rough set theory is a powerful tool for dealing with uncertainty, granuality and incompleteness of knowledge in information systems. Using rough set theory, this paper proposes a novel approach to intuitionistic fuzzy soft set based decision making problems. Firstly, by employing an intuitionistic fuzzy relation and a threshold value pair, we define a new rough set model and examine some fundamental properties of this rough set model. Then the concepts of approximate precision and rough degree are given and some basic properties are discussed. Furthermore, we investigate the relationship between intuitionistic fuzzy soft sets and intuitionistic fuzzy relations and present a rough set approach to intuitionistic fuzzy soft set based decision making. Finally, an illustrative example is employed to show the validity of this rough set approach in intuitionistic fuzzy soft set based decision making problems.     

Proof-theoretic conservations of weak weak intuitionistic constructive set theories

The paper aims to provide precise proof theoretic characterizations of Myhill–Friedman-style “weak” constructive extensional set theories and Aczel–Rathjen analogous constructive set theories both enriched by Mostowski-style collapsing axioms and/or related anti-foundation axioms. The main results include full intuitionistic conservations over the corresponding purely arithmetical formalisms that are well known in the reverse mathematics – which strengthens analogous results obtained by the author in the 80s. The present research was inspired by the more recent Sato-style “weak weak” classical extensional set theories whose proof theoretic strengths are shown to strongly exceed the ones of the intuitionistic counterparts in the presence of the collapsing axioms.     

A dominance intuitionistic fuzzy-rough set approach and its applications

Although the rough set and intuitionistic fuzzy set both capture the same notion, imprecision, studies on the combination of these two theories are rare. Rule extraction is an important task in a type of decision systems where condition attributes are taken as intuitionistic fuzzy values and those of decision attribute are crisp ones. To address this issue, this paper makes a contribution of the following aspects. First, a ranking method is introduced to construct the neighborhood of every object that is determined by intuitionistic fuzzy values of condition attributes. Moreover, an original notion, dominance intuitionistic fuzzy decision tables (DIFDT), is proposed in this paper. Second, a lower/upper approximation set of an object and crisp classes that are confirmed by decision attributes is ascertained by comparing the relation between them. Third, making use of the discernibility matrix and discernibility function, a lower and upper approximation reduction and rule extraction algorithm is devised to acquire knowledge from existing dominance intuitionistic fuzzy decision tables. Finally, the presented model and algorithms are applied to audit risk judgment on information system security auditing risk judgement for CISA, candidate global supplier selection in a manufacturing company, and cars classification.