Cut-free common knowledge

Starting off from the infinitary system for common knowledge over multi-modal epistemic logic presented in [L. Alberucci, G. Jäger, About cut elimination for logics of common knowledge, Annals of Pure and Applied Logic 133 (2005) 73–99], we apply the finite model property to “finitize” this deductive system. The result is a cut-free, sound and complete sequent calculus for common knowledge.     

Line-based affine reasoning in Euclidean plane

We consider the binary relations of parallelism and convergence between lines in a 2-dimensional affine space. Associating with parallelism and convergence the binary predicates P and C and the modal connectives [P] and [C], we consider a first-order theory based on these predicates and a modal logic based on these modal connectives. We investigate the axiomatization/completeness and the decidability/complexity of this first-order theory and this modal logic.     

LOGICAL PLURALISM AND SEMANTIC INFORMATION

Up to now theories of semantic information have implicitly relied on logical monism, or the view that there is one true logic. The latter position has been explicitly challenged by logical pluralists. Adopting an unbiased attitude in the philosophy of information, we take a suggestion from Beall and Restall at heart and exploit logical pluralism to recognise another kind of pluralism. The latter is called informational pluralism, a thesis whose implications for a theory of semantic information we explore. Research Assistant of the Fund for Scientific Research – Flanders (Belgium)     

On the construction of fuzzy preference structures

In this paper, we analyse the generalization of the classical method of the construction of a preference structure from a reflexive binary relation to the case of fuzzy binary relations. According to our approach, there are two interesting fuzzy preference structures we can construct from a given reflexive fuzzy binary relation. These two fuzzy preference structures correspond to the two extreme solutions of the system of functional equations in the method of Fodor and Roubens. We also prove that only one of two fuzzy preference structures allows its fuzzy relation of strict preference to be transitive with respect to the φ-transform of the Lukasiewicz t-norm when the reflexive fuzzy relation it is constructed from is also transitive with respect to the same t-norm. © 1998 John Wiley & Sons, Ltd.     

Fuzzy MCDM based on the concept of α‐cut

In a fuzzy multiple criteria decision‐making (MCDM) problem, with a hierarchical structure of more than two levels and involving multiple decision‐makers (DMs), to find the exact membership functions of the final aggregation ratings of all feasible alternatives is almost impossible. Thus, ranking methods based on exact membership functions cannot be utilized to rank the feasible alternatives and complete the optimal selection. To resolve the above‐mentioned complexity and to incorporate assessments of all DMs' viewpoints, in this paper a fuzzy MCDM method with multiple DMs, based on the concepts of fuzzy set theory and α‐cut, is developed. This method incorporates a number of perspectives on how to approach the fuzzy MCDM problem with multiple DMs, as follows: (1) combining quantitative and qualitative criteria as well as negative and positive ones; (2) using the generalized means to develop the aggregation method of multiple DMs' opinions; (3) incorporating the risk attitude index β to convey the total risk attitude of all DMs by using the estimation data obtained at the data input stage; (4) employing the algebraic operations of fuzzy numbers based on the concept of α‐cut to calculate the final aggregation ratings and develop a matching ranking method for proposed fuzzy MCDM method with multiple DMs. Furthermore, we use this method to survey the site selection for free port zone (FPZ) in Taiwan as an empirical study to demonstrate the proposed fuzzy MCDM algorithm. The result of this empirical investigation shows that the port of Kaohsiung, the largest international port of Taiwan as well as the sixth container port in the world in 2004, is optimal for the Taiwan government in enacting the plan of FPZ. Copyright © 2005 John Wiley & Sons, Ltd.     

An Application of MCDM in Water Resources Problems

In this paper a practical application of MCDM in water resources problems is presented. Based on a real project for Qinhuangdao water resources management sponsored by Qinhuangdao Municipality, we construct a set of models for inflow forecast, reservoir operations, water supply and allocation, and flood routing for system optimal operation and flood management. A stochastic dynamic programming (DP) model with a fuzzy criterion is proposed for monthly reservoir operations. A series of goal programming (GP) models is built for water supply and allocation on different planning and operating levels. The DP–GP models fulfil the optimal operation tasks of a water resources management decision support system (WRMDSS) for Qinhuangdao water resources management.     

Mathematical Fuzzy Logic – What It Can Learn from Mostowski and Rasiowa

Important works of Mostowski and Rasiowa dealing with many-valued logic are analyzed from the point of view of contemporary mathematical fuzzy logic.A version of this paper has been presented during 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.     

Definability and Interpolation in Non-Classical Logics

Algebraic approach to study of classical and non-classical logical calculi was developed and systematically presented by Helena Rasiowa in [48], [47]. It is very fruitful in investigation of non-classical logics because it makes possible to study large families of logics in an uniform way. In such research one can replace logics with suitable classes of algebras and apply powerful machinery of universal algebra. In this paper we present an overview of results on interpolation and definability in modal and positive logics,and also in extensions of Johansson's minimal logic. All these logics are strongly complete under algebraic semantics. It allows to combine syntactic methods with studying varieties of algebras and to flnd algebraic equivalents for interpolation and related properties. Moreover, we give exhaustive solution to interpolation and some related problems for many families of propositional logics and calculi. 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     

Beyond Rasiowa's Algebraic Approach to Non-classical Logics

This paper reviews the impact of Rasiowa's well-known book on the evolution of algebraic logic during the last thirty or forty years. It starts with some comments on the importance and influence of this book, highlighting some of the reasons for this influence, and some of its key points, mathematically speaking, concerning the general theory of algebraic logic, a theory nowadays called Abstract Algebraic Logic. Then, a consideration of the diverse ways in which these key points can be generalized allows us to survey some issues in the development of the field in the last twenty to thirty years. The last part of the paper reviews some recent lines of research that in some way transcend Rasiowa's approach. I hope in this way to give the reader a general view of Rasiowa's key position in the evolution of Algebraic Logic during the twentieth century. This paper is an extended 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     

A family of Gödel hybrid logics

In this paper, we define a family of fuzzy hybrid logics that are based on Gödel logic. It is composed of two infinite-valued versions called ${\mathsf{GH}}_{\infty }$ and ${\mathsf{WGH}}_{\infty }$, and a sequence of finitary valued versions ${({\mathsf{GH}}_n)}_{0<n<\infty }$. We define decision procedures for both ${\mathsf{WGH}}_{\infty }$ and ${({\mathsf{GH}}_n)}_{0<n<\infty }$ that are based on particular sequents and on a set of proof rules dealing with such sequents. As these rules are strongly invertible the procedures naturally allow one to generate countermodels. Therefore we prove the decidability and the finite model property for these logics. Finally, from the decision procedure of ${\mathsf{WGH}}_{\infty }$, we design a sound and complete sequent calculus for this logic.