Identifying and prioritizing factors influencing the selection of the top suppliers of e‐procurement using FDEMATEL and FANP

The aim of this study is to identify, rank, and determine the importance of factors influencing the selection of the top supplier of electronic procurement in organizations using a hybrid approach. This is a case study of Irancell Telecommunication Service Company in which fuzzy decision‐making trial and evaluation (FDEMATEL) and fuzzy analytical network process (FANP) were used. FDEMATEL was employed to determine the interaction and interrelationships among the identified criteria and subcriteria, while utilizing FANP to calculate the weights of the criteria and their relevant subcriteria to determine their priorities. Therefore, the research literature was first reviewed to identify the factors influencing the selection of suppliers. For this purpose, the experts on communication networks were interviewed to select 16 final factors as the most important subcriteria that were then categorized as 5 groups (technology, environmental, services, organizational, and commercial) on which the study was based. After extracting the criteria for ranking the suppliers, codifying evaluation questionnaire, and converting the opinions in the Likert scale, 16 criteria were finally chosen with scores above the mean. FDEMATEL was used to determine the weights of subcriteria. In the final step, FANP was employed for prioritization. Results indicate that the organizational criterion is the most influential factor; however, the criterion services is the most permeable factor. The greatest weights were obtained from production capacity and provisions and geographical situation which were weighted 0.097 and 0.039, respectively. They are also regarded as the most and least important criteria for the selection of the top supplier of e‐procurement by the experts.     

A procedural criterion for final derivability in inconsistency-adaptive logics

This paper concerns a (prospective) goal directed proof procedure for the propositional fragment of the inconsistency-adaptive logic ACLuN1. At the propositional level, the procedure forms an algorithm for final derivability. If extended to the predicative level, it provides a criterion for final derivability. This is essential in view of the absence of a positive test. The procedure may be generalized to all flat adaptive logics.     

Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation

Constructive logic with Nelson negation is an extension of the intuitionistic logic with a special type of negation expressing some features of constructive falsity and refutation by counterexample. In this paper we generalize this logic weakening maximally the underlying intuitionistic negation. The resulting system, called subminimal logic with Nelson negation, is studied by means of a kind of algebras called generalized N-lattices. We show that generalized N-lattices admit representation formalizing the intuitive idea of refutation by means of counterexamples giving in this way a counterexample semantics of the logic in question and some of its natural extensions. Among the extensions which are near to the intuitionistic logic are the minimal logic with Nelson negation which is an extension of the Johansson's minimal logic with Nelson negation and its in a sense dual version — the co-minimal logic with Nelson negation. Among the extensions near to the classical logic are the well known 3-valued logic of Lukasiewicz, two 12-valued logics and one 48-valued logic. Standard questions for all these logics — decidability, Kripke-style semantics, complete axiomatizability, conservativeness are studied. At the end of the paper extensions based on a new connective of self-dual conjunction and an analog of the Lukasiewicz middle value ½ have also been considered.     

The Class of Extensions of Nelson's Paraconsistent Logic

The article is devoted to the systematic study of the lattice εN4_⊥ consisting of logics extending N4_⊥. The logic N4_⊥ is obtained from paraconsistent Nelson logic N4 by adding the new constant ⊥ and axioms ⊥ → p, p → ∼ ⊥. We study interrelations between εN4_⊥ and the lattice of superintuitionistic logics. Distinguish in εN4_⊥ basic subclasses of explosive logics, normal logics, logics of general form and study how they are relate. The author acknowledges support by the Alexander von Humboldt-Stiftung and by Counsil for Grants under RF President, project NSh - 2112.2003.1.     

An Adaptive Logic Based on Jaśkowskiˈs Approach to Paraconsistency

In this paper, I present the modal adaptive logic AJ ^r (based on S5) as well as the discussive logic D ^r ₂ that is defined from it. D ^r ₂ is a (non-monotonic) alternative for Jaśkowski’s paraconsistent system D ₂ . Like D ₂ , D ^r ₂ validates all single-premise rules of Classical Logic. However, for formulas that behave consistently, D ^r ₂ moreover validates all multiple-premise rules of Classical Logic. Importantly, and unlike in the case of D ₂ , this does not require the introduction of discussive connectives. It is argued that this has clear advantages with respect to one of the main application contexts of discussive logics, namely the interpretation of discussions.*Research for this paper was indirectly supported by the Flemish Minister responsible for Science and Technology (contract BIL1/8). The author is indebted to Leon Horsten, Jo?o Marcos, Jerzy Perzanowski, Liza Verhoeven, and especially to the referee and to Diderik Batens for comments and suggestions.     

Willem Blok's Contribution to Abstract Algebraic Logic

Willem Blok was one of the founders of the field Abstract Algebraic Logic. The paper describes his research in this field. Dedicated to the memory of Willem Johannes Blok     

Universes of Fuzzy Sets and Axiomatizations of Fuzzy Set Theory. Part I: Model-Based and Axiomatic Approaches

For classical sets one has with the cumulative hierarchy of sets, with axiomatizations like the system ZF, and with the category SET of all sets and mappings standard approaches toward global universes of all sets. We discuss here the corresponding situation for fuzzy set theory.Our emphasis will be on various approaches toward (more or less naively formed)universes of fuzzy sets as well as on axiomatizations, and on categories of fuzzy sets. What we give is a (critical)survey of quite a lot of such approaches which have been offered in the last approximately 35 years. The present Part I is devoted to model based and to axiomatic approaches; the forth-coming Part II will be devoted to category theoretic approaches. This paper is a version of the invited talk given by the author at the conference Trends in Logic III, dedicated to the memory of A. MOSTOWSKI, H. RASIOWA and C. RAUSZER, and held in Warsaw and Ruciane-Nida from 23rd to 25th September 2005. Presented by Jacek Malinowski     

Towards a Semantic Characterization of Cut-Elimination

We introduce necessary and sufficient conditions for a (single-conclusion) sequent calculus to admit (reductive) cut-elimination. Our conditions are formulated both syntactically and semantically.     

Maximal Subalgebras of MVn-algebras. A Proof of a Conjecture of A. Monteiro

For each integer n ≥ 2, MV_n denotes the variety of MV-algebras generated by the MV-chain with n elements. Algebras in MV_n are represented as continuous functions from a Boolean space into a n-element chain equipped with the discrete topology. Using these representations, maximal subalgebras of algebras in MV_n are characterized, and it is shown that proper subalgebras are intersection of maximal subalgebras. When A ∈ MV₃, the mentioned characterization of maximal subalgebras of A can be given in terms of prime filters of the underlying lattice of A, in the form that was conjectured by A. Monteiro. Mathematics Subject Classification (2000): 06D30, 06D35, 03G20, 03B50, 08A30. Presented by Daniele Mundici     

The Beth Property in Algebraic Logic

The present paper is a study in abstract algebraic logic. We investigate the correspondence between the metalogical Beth property and the algebraic property of surjectivity of epimorphisms. It will be shown that this correspondence holds for the large class of equivalential logics. We apply our characterization theorem to relevance logics and many-valued logics. Dedicated to the memory of Willem Johannes Blok