An Extension Principle for Fuzzy Logics

Let S be a set, P(S) the class of all subsets of S and F(S) the class of all fuzzy subsets of S. In this paper an “extension principle” for closure operators and, in particular, for deduction systems is proposed and examined. Namely we propose a way to extend any closure operator J defined in P(S) into a fuzzy closure operator J* defined in F(S). This enables us to give the notion of canonical extension of a deduction system and to give interesting examples of fuzzy logics. In particular, the canonical extension of the classical propositional calculus is defined and it is showed its connection with possibility and necessity measures. Also, the canonical extension of first order logic enables us to extend some basic notions of programming logic, namely to define the fuzzy Herbrand models of a fuzzy program. Finally, we show that the extension principle enables us to obtain fuzzy logics related to fuzzy subalgebra theory and graded consequence relation theory. Mathematics Subject Classification : 03B52.     

A normalizing system of natural deduction for intuitionistic linear logic

 The main result of this paper is a normalizing system of natural deduction for the full language of intuitionistic linear logic. No explicit weakening or contraction rules for -formulas are needed. By the systematic use of general elimination rules a correspondence between normal derivations and cut-free derivations in sequent calculus is obtained. Normalization and the subformula property for normal derivations follow through translation to sequent calculus and cut-elimination. Received: 10 October 2000 / Revised version: 26 July 2001 / Published online: 2 September 2002 Mathematics Subject Classification (2000): 03F52, 03F05 Keywords or phrases: Linear logic – Natural deduction – General elimination rules     

The algebra of fuzzy logic

In the following, human thinking based on premises with no complete truth value is reviewed for controlling the algebra of fuzzy sets operations. Assuming a system may be developed in this sphere, it should be considered as the algebra of fuzzy sets, as the same algebra is satisfied by classical logic and sets. As will be proved, this algebra is not a lattice and consequently the Zadeh definitions do not constitute an adequate representation. The binary operations of my algebra are “interactive” types. An axiom system is given that, in my opinion, is the foundation of the conception, adequately and without redundancy. The agreement of the theorems deduced from the axiom system with the intuitive expectations is shown. A special arithmetical structure satisfying this algebra is given, and the relation between this structure and the theory of probability is analyzed.Adapting a process of classical logics, fuzzy quantifiers are defined on the basis of the operations of propositional algebra. A “qualifier” is also defined. The qualifier is functional; applying it to Ax we get the statement “usually Ax” s a middle cource between the statements “at least once Ax” and “always Ax”. The concept of entailment of fuzzy logics is introduced. This concept is an innovative generalization of the classical deduction theory, opposite to the concept of entailment of classical multi-valued logics. An important error of the abbreviated system of notation of the fuzzy theory [e.g. m(x, AvB)] appears: the functional type operations (e.g. quantifiers) cannot be interpreted in propositional calculus. Therefore a new system of symbols is proposed in this paper.     

一类不确定非线性系统的执行器故障模糊容错控制

针对一类状态不完全可测的不确定非线性系统,研究了带有执行器故障的容错控制问题.采用 T-S模型对非线性系统进行模糊建模,利用并行分布补偿(PDC)算法设计了状态现潮器和基于状态现 潮器的客错控制,给出了保证该模糊容错控制系统稳定的充分条件.根据李雅普诺夫稳定性理论和线性 矩阵不等式(LMI),证明了所提出的模糊容错控制方法不但使得模糊控制系统渐近稳定,而且能够取得 H∞性能指标.计算机仿真结果进一步验证了所提出方法的正确性.     

模糊连续需求下供应链收益共享契约机制研究

研究一个由供应商和零售商组成的两级供应链系统在模糊连续需求环境下的运作过程。将市场需求视为三角模糊数,利用模糊截集理论分析模糊连续需求下的分散决策和集中决策过程,并给出收益共享契约机制下的决策模型。研究结果表明：在模糊连续需求环境下,零售商的订购量存在唯一最优解;供应链系统的“双重边际化”效应同样存在;收益共享契约机制可以实现供应链中成员问的协调。最后,通过数值例子对模型进行了比较分析。     

F—fuzzy演绎系统

本文建立了一种演绎系统FFCS,在该演义系统中可以处理具有模糊性的推理过程,区别与其他对模糊推理进行形式化的逻辑系统,FFCS对模糊假言推理FMP做了完全形式化的处理。     

基于观测器的模糊Delta算子系统的控制器设计

对于非线性模糊系统控制器和观测器的分析和设计,提出一种统一方法。利用Delta域离散T—S模糊模型对非线性系统建模,并基于李雅普诺夫稳定性理论给出模糊状态反馈控制器和观测器的设计策略,将所得结果归结为求解一组线性矩阵不等式。同时结论表明:分离性原理对Delta算子T—S模糊系统仍然成立。所得结果可将现有关于连续和离散T—S模糊系统的相关结论统一于Delta算子框架内。     

Natural deduction with general elimination rules

The structure of derivations in natural deduction is analyzed through isomorphism with a suitable sequent calculus, with twelve hidden convertibilities revealed in usual natural deduction. A general formulation of conjunction and implication elimination rules is given, analogous to disjunction elimination. Normalization through permutative conversions now applies in all cases. Derivations in normal form have all major premisses of elimination rules as assumptions. Conversion in any order terminates. Through the condition that in a cut-free derivation of the sequent Γ⇒C, no inactive weakening or contraction formulas remain in Γ, a correspondence with the formal derivability relation of natural deduction is obtained: All formulas of Γ become open assumptions in natural deduction, through an inductively defined translation. Weakenings are interpreted as vacuous discharges, and contractions as multiple discharges. In the other direction, non-normal derivations translate into derivations with cuts having the cut formula principal either in both premisses or in the right premiss only. Received: 1 December 1998 / Revised version: 30 June 2000 / Published online: 18 July 2001     

模糊数非单调变换下的结构元表示

在模糊数的结构元表示B~=f(E)中,要求f(x)在[-1,1]上单调,将f(x)扩展为[-1,1]上的连续函数,在证明f(E)是有界模糊数的基础上,给出了相应模糊数的隶属函数表达形式。由于单调性质在模糊数的运算表示中具有重要作用,还得出非单调连续函数f(x)的E-等价函数概念,并给出了E-等价函数的求法。对于算例,用结构元理论是无法求解的,用本文的方法给出解答。     

Dual bounding procedures lead to convergent Branch–and–Bound algorithms

Branch–and–Bound methods with dual bounding procedures have recently been used to solve several continuous global optimization problems. We improve results on their convergence theory and give a condition that enables us to detect infeasible partition sets from the dual optimal value. Received: May 5, 1999 / Accepted: April 19, 2001?Published online September 17, 2001     

Aristotle’s Prototype Rule-Based Underlying Logic

This expository paper on Aristotle’s prototype underlying logic is intended for a broad audience that includes non-specialists. It requires as background a discussion of Aristotle’s demonstrative logic. Demonstrative logic or apodictics is the study of demonstration as opposed to persuasion. It is the subject of Aristotle’s two-volume Analytics, as its first sentence says. Many of Aristotle’s examples are geometrical. A typical geometrical demonstration requires a theorem that is to be demonstrated, known premises from which the theorem is to be deduced, and a deductive logic by which the steps of the deduction proceed. Every demonstration produces (or confirms) knowledge of (the truth of) its conclusion for every person who comprehends the demonstration. Aristotle presented a general truth-and-consequence theory of demonstration meant to apply to all demonstrations: a demonstration is an extended argumentation that begins with premises known to be truths and that involves a chain of reasoning showing by deductively evident steps that its conclusion is a consequence of its premises. In short, a demonstration is a deduction whose premises are known to be true. Aristotle’s general theory of demonstration required a prior general theory of deduction presented in the Prior Analytics. His general immediate-deduction-chaining theory of deduction was meant to apply to all deductions: any deduction that is not immediately evident is an extended argumentation that involves a chaining of immediately evident steps that shows its final conclusion to follow logically from its premises. His deductions, both direct and indirect, were rule-based and not tautology-based. The idea of tautology-based deduction, which dominated modern logic in the early years of the 1900s, is nowhere to be found in Analytics. Rule-based (or “natural”) deduction was rediscovered by modern logicians. To illustrate his general theory of deduction, Aristotle presented a prototype: an ingeniously simple and mathematically precise special case traditionally known as the categorical syllogistic. With reference only to propositions of the four so-called categorical forms, he painstakingly worked out exactly what those immediately evident deductive steps are and how they are chained to complete deductions. In his specialized prototype theory, Aristotle explained how to deduce from a given categorical premise set, no matter how large, any categorical conclusion implied by the given set. He did not extend this treatment to non-categorical deductions, thus setting a program for future logicians. The prototype, categorical syllogistic, was seen by Boole as a “first approximation” to a comprehensive logic. Today, however it appears more as the first of the dozens of logics already created and as the first exemplification of a family that continues to expand.     

Chance constrained programming models for refinery short-term crude oil scheduling problem

The main objective of this work is to put forward chance constrained mixed-integer nonlinear stochastic and fuzzy programming models for refinery short-term crude oil scheduling problem under demands uncertainty of distillation units. The scheduling problem studied has characteristics of discrete events and continuous events coexistence, multistage, multiproduct, nonlinear, uncertainty and large scale. At first, the two models are transformed into their equivalent stochastic and fuzzy mixed-integer linear programming (MILP) models by using the method of Quesada and Grossmann [I. Quesada, I E. Grossmann, Global optimization of bilinear process networks with multicomponent flows, Comput. Chem. Eng. 19 (12) (1995) 1219–1242], respectively. After that, the stochastic equivalent model is converted into its deterministic MILP model through probabilistic theory. The fuzzy equivalent model is transformed into its crisp MILP model relies on the fuzzy theory presented by Liu and Iwamura [B.D. Liu, K. Iwamura, Chance constrained programming with fuzzy parameters, Fuzzy Sets Syst. 94 (2) (1998) 227–237] for the first time in this area. Finally, the two crisp MILP models are solved in LINGO 8.0 based on scheduling time discretization. A case study which has 267 continuous variables, 68 binary variables and 320 constraints is effectively solved with the solution approaches proposed.     

基础R0-代数的性质及在L*系统中的应用

研究了王国俊教授建立的模糊命题演算的形式演绎系统L^*和与之在语义上相关的R₀-代数,提出了基础R₀-代数的观点并讨论了其中的一些性质,在将L^*系统中的推演证明转化为相应的R₀-代数中的代数运算方面作了一些尝试,作为它的一个应用,证明了L^*系统中的模糊演绎定理。     

Lukasiewicz 命题逻辑系统一种新的理论的相容度

根据演绎定理和完备性定理,应用公式真度理论在Lukasiewicz命题模糊逻辑系统中讨论理论Γ的相容性,根据矛盾式■是Γ-结论的真度的大小,提出了一种新的极指标和相容度的概念.给出了理论Γ相容、不相容及其它相关结论的充分必要条件,并且获得了相容度与发散度之间联系的重要关系式.     

A New View on Fuzzy Hypermodules

We describe the relationship between the fuzzy sets and the algebraic hyperstructures. In fact, this paper is a continuation of the ideas presented by Davvaz in （Fuzzy Sets Syst., 117： 477- 484, 2001） and Bhakat and Das in （Fuzzy Sets Syst., 80： 359-368, 1996）. The concept of the quasicoincidence of a fuzzy interval value with an interval-valued fuzzy set is introduced and this is a natural generalization of the quasi-coincidence of a fuzzy point in fuzzy sets. By using this new idea, the concept of interval-valued （α,β）-fuzzy sub-hypermodules of a hypermodule is defined. This newly defined interval-valued （α,β）-fuzzy sub-hypermodule is a We shall study such fuzzy sub-hypermodules and sub-hypermodules of a hypermodule. generalization of the usual fuzzy sub-hypermodule. consider the implication-based interval-valued fuzzy     

Hypoelliptic non-homogeneous diffusions

 Let be a time dependent second order operator, written in usual or H?rmander form. We study the regularity of the law of the associated non-homogeneous (time dependent) diffusion process, under H?rmander's like conditions. Coefficients are only H?lder continuous in time. The main tool is Malliavin calculus. Our results extend and correct previous ones ([17] and related works, [15]). Related topics like filtering theory, killed or reflected processes, parabolic hypoellipticity are also discussed. Received: October 1999/Revised version: 12 November 2001 / Published online: 1 July 2002     

Approximations by linear operators in spaces of fuzzy continuous functions

In this work, we further develop the Korovkin-type approximation theory by utilizing a fuzzy logic approach and principles of neoclassical analysis, which is a new branch of fuzzy mathematics and extends possibilities provided by the classical analysis. In the conventional setting, the Korovkin-type approximation theory is developed for continuous functions. Here we extend it to the space of fuzzy continuous functions, which contains a great diversity of functions that are not continuous. Furthermore, we give several applications, demonstrating that our new approximation results are stronger than the classical ones.     

The Cauchy problem of the Ward equation

We generalize the results of [J. Villarroel, The inverse problem for Ward's system, Stud. Appl. Math. 83 (1990) 211-222; A.S. Fokas, T.A. Ioannidou, The inverse spectral theory for the Ward equation and for the 2+1 chiral model, Comm. Appl. Anal. 5 (2001) 235-246; B. Dai, C.L. Terng, K. Uhlenbeck, On the space-time Monopole equation, arXiv:math.DG/0602607] to study the inverse scattering problem of the Ward equation with non-small data and solve the Cauchy problem of the Ward equation with a non-small purely continuous scattering data.     

Logic of agreement: Foundations,semantic system and proof theory

In this paper a multi-valued propositional logic — logic of agreement — in terms of its model theory and inference system is presented. This formal system is the natural consequence of a new way to approach concepts as commonsense knowledge, uncertainty and approximate reasoning — the point of view of agreement. Particularly, it is discussed a possible extension of the Classical Theory of Sets based on the idea that, instead of trying to conceptualize sets as “fuzzy” or “vague” entities, it is more adequate to define membership as the result of a partial agreement among a group of individual agents. Furthermore, it is shown that the concept of agreement provides a framework for the development of a formal and sound explanation for concepts (e.g. fuzzy sets) which lack formal semantics. According to the definition of agreement, an individual agent agrees or not with the fact that an object possesses a certain property. A clear distinction is then established, between an individual agent — to whom deciding whether an element belongs to a set is just a yes or no matter — and a commonsensical agent — the one who interprets the knowledge shared by a certain group of people. Finally, the logic of agreement is presented and discussed. As it is assumed the existence of several individual agents, the semantic system is based on the perspective that each individual agent defines her/his own conceptualization of reality. So the semantics of the logic of agreement can be seen as being similar to a semantics of possible worlds, one for each individual agent. The proof theory is an extension of a natural deduction system, using supported formulas and incorporating only inference rules. Moreover, the soundness and completeness of the logic of agreement are also presented.     

Analytic continuation for Beltrami systems, Siegel's Theorem for UQR maps, and the Hilbert-Smith Conjecture

A uniformly quasiregular mapping, is a mapping of the m-sphere with the property that it and all its iterates have uniformly bounded distortion. Such maps are rational with respect to some bounded measurable conformal structure and there is a Fatou-Julia type theory associated with the dynamical system obtained by iterating these mappings. We begin by investigating the analogue of Siegel's theorem on the local conjuga cy of rotational dynamics. We are led to consider the analytic continuation properties of solutions to the highly nonlinear first order Beltrami systems. We reduce these problems to a central and well known conjecture in the theory of transformation groups; namely the Hilbert-Smith conjecture, which roughly asserts that effective transformation groups of manifolds are Lie groups. Our affirmative solution to this problem then implies unique analytic continuation and Siegel's theorem. Received: 14 September 2000 / Revised version: 23 November 2001 / Published online: 5 September 2002 RID="*" ID="*" Research supported in part by grants from the Marsden Fund and Royal Society (NZ).