Toward extended fuzzy logic—A first step

Fuzzy logic adds to bivalent logic an important capability—a capability to reason precisely with imperfect information. Imperfect information is information which in one or more respects is imprecise, uncertain, incomplete, unreliable, vague or partially true. In fuzzy logic, results of reasoning are expected to be provably valid, or p-valid for short. Extended fuzzy logic adds an equally important capability—a capability to reason imprecisely with imperfect information. This capability comes into play when precise reasoning is infeasible, excessively costly or unneeded. In extended fuzzy logic, p-validity of results is desirable but not required. What is admissible is a mode of reasoning which is fuzzily valid, or f-valid for short. Actually, much of everyday human reasoning is f-valid reasoning.f-Valid reasoning falls within the province of what may be called unprecisiated fuzzy logic, FLu. FLu is the logic which underlies what is referred to as f-geometry. In f-geometry, geometric figures are drawn by hand with a spray pen—a miniaturized spray can. In Euclidean geometry, a crisp concept, C, corresponds to a fuzzy concept, f-C, in f-geometry. f-C is referred to as an f-transform of C, with C serving as the prototype of f-C. f-C may be interpreted as the result of execution of the instructions: Draw C by hand with a spray pen. Thus, in f-geometry we have f-points, f-lines, f-triangles, f-circles, etc. In addition, we have f-transforms of higher-level concepts: f-parallel, f-similar, f-axiom, f-definition, f-theorem, etc. In f-geometry, p-valid reasoning does not apply. Basically, f-geometry may be viewed as an f-transform of Euclidean geometry.What is important to note is that f-valid reasoning based on a realistic model may be more useful than p-valid reasoning based on an unrealistic model.     

Robust design of rule-based fuzzy controllers

This paper deals with the design of stable and robust rule-based fuzzy control systems. New expressions to compute indices which provide a measure of the stability and robustness of fuzzy control systems are presented. The relation between the modification of the rules and the stability is studied through the so-called sensitivity indices. The paper presents procedures that make use of these indices to improve the design of fuzzy control systems, including the modification of the rules to obtain the global stability of an unstable system with multiple attractors, and to improve the dynamic behavior or the robustness of a non-linear plant. An example with a fuzzy controller for a system with non-linear damping and saturation in the actuation is presented to illustrate the design procedure.     

对苯二甲醛缩二氨基硫脲-钆配合物的合成及阴离子识别研究

合成了化合物(2E,2′E)-2,2′-(1,4-苯基双亚甲基双硫代氨基脲)(C10H12N6S2)(L),利用L与钆离子形成了配合物(GdL)。用UV-Vis吸收光谱考察其与F-、Cl-、Br-、I-、Ac-、NO3-、HSO4-和H2PO4-等阴离子的识别。研究表明,加入F-或H2PO4-时,溶液颜色由无色变为黄色,加入其它阴离子没有变化,从而实现受体对这两种阴离子的检测。Job法表明主客体间形成1∶1配合物。受体对两种离子的识别作用主要源于配合物多余的结合位点。在此基础上,以GdL的DMSO溶液作为起始状态,以F-和H2PO4-为两化学输入,构建了一个"或"(OR)分子逻辑门。     

Partially entangled states bridge in quantum teleportation

The traditional method for information transfer in a quantum communication system using partially entangled state resource is quantum distillation or direct teleportation. In order to reduce the waiting time cost in hop-by-hop transmission and execute independently in each node, we propose a quantum bridging method with partially entangled states to teleport quantum states from source node to destination node. We also prove that the designed specific quantum bridging circuit is feasible for partially entangled states teleportation across multiple intermediate nodes. Compared to two traditional ways, our partially entanglement quantum bridging method uses simpler logic gates, has better security, and can be used in less quantum resource situation.     

Fluorescent Logic Gates Chemically Attached to Silicon Nanowires

I′m in the mood for dansyl : A chemically controlled fluorescent logic gate was formed by grafting a dansyl unit onto silicon nanowires (SiNWs; see picture). The logic gate was operated by utilizing pH changes, Hg^II, and Cl^? or Br^? ions as inputs and the fluorescence of the modified SiNWs as output. The modified SiNWs could perform as a three‐input logic gate that combines the YES and INH operations.

     

工程系统可靠度的逻辑分析与优化设计

基于结构逻辑图的理论，提出了以下确界算子和上确界算子分别作为串联与并联系统可靠度的计算模型；形成了复杂工程系统可靠度的逻辑分析方法。在此基础上，应用多阶段决策算子法，成功地求解了工程系统可靠度的优化设计问题；给出了桁架结构优化的数值计算例题。     

Strong Normalizability of Typed Lambda-Calculi for Substructural Logics

The strong normalization theorem is uniformly proved for typed λ-calculi for a wide range of substructural logics with or without strong negation. We would like to thank the referees for their valuable comments and suggestions. This research was supported by the Alexander von Humboldt Foundation. The second author is grateful to the Foundation for providing excellent working conditions and generous support of this research. This work was also supported by the Japanese Ministry of Education, Culture, Sports, Science and Technology, Grant-in-Aid for Young Scientists (B) 20700015, 2008.     

Mining information from time series in the form of sentences of natural language

The goal of this paper is to provide a more detailed explanation of the principles how special formulas that characterize properties of trend of time series can be formed and how they are interpreted. Then we show how these formulas can be used in a tectogrammatical tree that construes special sentences of natural language, using which information on behavior of time series is provided. We also outline the principles of mining this information. The last part is devoted to application of the theory of intermediate quantifiers to mining summarized information on time series also in sentences of natural language.     

THE Σλ-CALCULUS AND DERIVED PROGRAM FORMS

Abstract

The Σλ-calculus is an extension of an applied λ-calculus designed to abstract parallel and non-deterministic function application evaluation. The abstraction is extended to include Landin's closure, and constant terms and a special form of the conditional allows the regular logics to be developed along the lines of the Hilbert-Ackermann approach. The regular logics are used to characterize derived conditionals in extensions to Dijkstra's weakest preconditions. It is shown that various styles of programming—top-down, bottom-up, recursive and iterative—axe expressible in the Σλ-calculus. Lists and streams are found to be useful in expressing time-dependent behaviour of computational systems. An approximate Church-Rosser Theorem is given.     

Subintuitionistic logics and the implications they prove

This is an investigation of the implications of IPC which remain provable when one weakens intuitionistic logic in various ways. The research is concerned with logics with Kripke models as introduced by G. Corsi in 1987, and others like G. Restall, Do?en, Visser. This leads to conservativity results for IPC with regard to classes of implications in some of these logics. Moreover, similar results are reached for some weaker subintuitionistic systems with neighborhood models introduced by the authors in 2016. In addition, the relationship between two types of neighborhood models introduced in that work is clarified. This clarification leads also to modal companions for weaker logics.