n值逻辑系统中条件随机真度理论

在n值命题逻辑系统中命题的随机真度、随机逻辑度量空间的基础上,给出了修正的n值G¨odel命题逻辑系统中命题的条件真度、条件相似度的概念并讨论了其性质,建立了条件随机逻辑度量空间。     

二值命题逻辑中有限理论数值特征的真度研究

以真度为基础,给出了有限理论的发散度、伪距离和有效度等数值特征的一般真度表示式,并研究了它们之间的关系.     

逻辑系统$G_3$中命题的真度值之集在[0,1]上的分布

利用势为3的均匀概率空间的无穷乘积在G■del三值命题逻辑中引入了公式的真度概念,给出了真度推理规则,证明了全体公式的真度值之集在[0,1]上是稠密的,并给出了公式真度的表达通式,为进一步建立三值命题逻辑的近似推理理论奠定了基础．     

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

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

A topological characterization of consistency of logic theories in propositional logic

The main purpose of this note is to characterize consistency of logic theories in propositional logic by means of topological concept. Based on the concepts of truth degree of formulas and similarity degree between formulas the concept of logic metric space has been proposed by the first author. It is proved in this note that a closed logic theory Γ is consistent if and only if it contains no interior point in the logic metric space. Moreover the relationship between logic closedness and topological closedness of a logic theory Γ is discussed. Finally, the concept of full divergency is also characterized by means of the topological concept of density. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the infinite-valued Łukasiewicz logic that preserves degrees of truth

Łukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Łukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from Łukasiewicz algebra by using a “truth-preserving” scheme. This deductive system is algebraizable, non-selfextensional and does not satisfy the deduction theorem. In addition, there exists no Gentzen calculus fully adequate for it. Another presentation of the same deductive system can be obtained from a substructural Gentzen calculus. In this paper we use the framework of abstract algebraic logic to study a different deductive system which uses the aforementioned algebra under a scheme of “preservation of degrees of truth”. We characterize the resulting deductive system in a natural way by using the lattice filters of Wajsberg algebras, and also by using a structural Gentzen calculus, which is shown to be fully adequate for it. This logic is an interesting example for the general theory: it is selfextensional, non-protoalgebraic, and satisfies a “graded” deduction theorem. Moreover, the Gentzen system is algebraizable. The first deductive system mentioned turns out to be the extension of the second by the rule of Modus Ponens.While writing this paper, the authors were partially supported by grants MTM2004-03101 and TIN2004-07933-C03-02 of the Spanish Ministry of Education and Science, including FEDER funds of the European Union.     

三值R_0命题逻辑系统中理论的随机发散度

在三值R_0命题逻辑系统中,给出了随机相似度和随机逻辑伪距离的基本性质.然后在随机逻辑度量空间中提出了理论的随机发散度,指出全体原子公式之集在随机逻辑度量空间中未必是全发散的,其是否全发散取决于给定的随机数序的分布.     

逻辑系统G3在非均匀概率空间下命题的真度理论

在离散概率测度空间下定义了三值逻辑（p,q,r）测度，并相应地定义了命题逻辑系统中公式的真度概念；在三值逻辑（1/6．1/3．1/2）测度和（1/7．2/7.4/7）测度下证明了命题逻辑系统G3中全体公式的真度值之集在[0．1]上是稠密的，并给出真度的表达式；利用真度定义公式的相似度和一种伪距离，为—般离散概率空间下三值命题的近似推理理论提供一种可能的框架．     

A uniform approach of linguistic truth values in sensor evaluation

During the sensor evaluation procedure, each valuator uses his/her own ordinary linguistic truth values for the same factor because of different preference. That will brings some disadvantages to aggregate the information. For a uniform criterion, the standard linguistic truth value (SLTV) set is proposed. Based on the former hypothesis of transformation models of linguistic truth values, four transformation models are discussed: the model of point to point, the model of fuzzy set to point, the model of point to fuzzy set and the model of fuzzy set to fuzzy set. An example is to analyze it. Using the applicability measure we can choose appropriate SLTV for the different sensory evaluation system.     

基于区间数贴近度的不确定多属性决策模型

针对只有部分权重信息且属性值以区间数形式给出的多属性决策问题,提出了一种基于区间数贴近度的决策方法.首先讨论了区间数贴近度的定义和性质;然后给出了解决不确定多属性决策问题的一般步骤.并依据传统的逼近理想解的基本思路,以实际评价值与理想解之间的贴近度最大化为目标建立优化模型,从而得到指标权重.进而计算出每个方案与正理想解的相对贴近度,即可得到所有方案的排序结果.方法能充分利用规范化评价的先验信息,评价结果客观可靠,不具有主观随意性.最后通过实例分析验证了该方法的有效性和实用性.     

n值Lukasiewicz命题逻辑系统中公式的随机真度及近似推理

利用赋值集的随机化方法,在n值Lukasiewicz命题逻辑系统中引入公式的随机真度,证明了随机真度的MP规则、HS规则及交推理规则;同时引入公式间的随机相似度和随机伪距离,建立了随机逻辑度量空间,推导出随机相似度的若干性质,证明了随机逻辑度量空间中逻辑运算的连续性;并在随机逻辑度量空间中提出了三种不同类型的近似推理模式,证明了三种近似推理模式的等价性.     

严格集压缩映射和凝聚映射的延拓定理及应用(英文)

应用著名的Dugundji延拓定理和Urysohn引理,将Hilbert空间E中有界闭凸集D上的k-集压缩映射和聚映射延拓到全空间,并给出了其在拓扑度计算方面的应用.     

Generalized type theorems in topological spaces with applications

In this work, some new generalized type theorems for generalized mappings with compactly open values are established in topological spaces without any convexity assumptions. As applications, a Ky Fan type matching theorem, fixed point theorem and coincidence theorem are obtained in topological spaces. These results generalize some known results from the recent literature.     

多元随机序列泛函的强偏差定理

利用熵密度和样本偏差率的概念,建立了多元随机序列泛函关于条件期望的用不等式表示的强极限性质(称之为强偏差定理),在推论部分得到了非齐次马氏链的强偏差定理和随机条件概率的调和平均值的极限性质等相关结论.证明中给出了将条件矩母函数应用于研究多元随机序列泛函的强极限性质的一种途径.     

Large Deviation Theorems for Gaussian Processes and Their Applications in Information Theory

We discuss on the large deviation theorems for stationary Gaussian processes and their applications in information theory. The topics investigated here include error probability of string matching, error probabilities for random codings, and a conditional limit theorem which justifies the maximum entropy principle.     

赋范空间中渐近伪压缩映象不动点的迭代逼近

设x是赋范线性空间，D是x的非空子集．设T：D→x是一个一致L—Lipschitz的渐近伪压缩映象，F(T)表T的不动点集且F(T)非空．在迭代参数(αn)和(βn)的适当假设下，证明了修改了的具有误差项的Ishikawa和Mann迭代过程强收敛于T的不动点q．几个相关结果处理赋范空间中渐近非扩张映象不动点的迭代逼近问题．所得结果改进和推广了Chang，Park和Cho，Geobel和Kirl，Liu以及Schu等人的相关结果．     

A critical assessment of truth functional modification and its use in approximate reasoning

We examine the inconsistencies in the current notion of fuzzy truth values and show how these have arisen from an attempt to equate two separate concepts. We argue that any approximate reasoning system based on truth functional modification is redundnat and inefficient.     

一阶模糊谓词逻辑公式的解释模型真度理论及其应用

基于一阶模糊谓词逻辑公式的有限和可数解释真度的理论,引入了一阶模糊谓词逻辑公式的解释模型及解释模型真度的概念,并讨论了它们的一系列性质及其在近似推理中的应用.     

On the Structure of Submanifolds with Degenerate Gauss Maps

An n-dimensional submanifold X of a projective space P ^N (C) is called tangentially degenerate if the rank of its Gauss mapping gamma;; X G(n, N) satisfies 0 < rank < n. The authors systematically study the geometry of tangentially degenerate submanifolds of a projective space P ^N (C). By means of the focal images, three basic types of submanifolds are discovered: cones, tangentially degenerate hypersurfaces, and torsal submanifolds. Moreover, for tangentially degenerate submanifolds, a structural theorem is proven. By this theorem, tangentially degenerate submanifolds that do not belong to one of the basic types are foliated into submanifolds of basic types. In the proof the authors introduce irreducible, reducible, and completely reducible tangentially degenerate submanifolds. It is found that cones and tangentially degenerate hypersurfaces are irreducible, and torsal submanifolds are completely reducible while all other tangentially degenerate submanifolds not belonging to basic types are reducible.