首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
关于Boole语义的真度不变性定理   总被引:2,自引:1,他引:1  
基于B-赋值理论,在B为有限Boole代数的前提下,得出了三个主要结论。首先,讨论了广义Boole函数与Boole函数之间的关系。其次,得出了在有限Boole语义理论意义下的真度不变性定理。最后给出了经典逻辑系统关于有限Boole语义的完备性定理。  相似文献   

2.
左卫兵 《数学杂志》2013,(3):493-500
本文研究了有限Boole语义中基于前提信息的随机化问题.利用赋值集的随机化方法,提出了公式的基于前提信息Γ的Γ-随机真度,得到了Γ-随机真度的MP规则,HS规则和交推理规则.通过引入公式间的Γ-随机相似度和Γ-伪距离,建立了Γ-随机逻辑度量空间,在有限Boole语义上推广了基于前提信息的近似推理理论.  相似文献   

3.
基于条件概率的思想,利用赋值集的随机化方法,在有限Boole语义中引入公式的条件随机真度,证明了条件随机真度的MP规则和HS规则。引入公式间的条件相似度和条件伪距离,建立了条件随机逻辑度量空间,证明了条件随机逻辑度量空间中逻辑运算的连续性,并初步研究了给定条件下的近似推理理论。  相似文献   

4.
利用赋值集的随机化方法,在R0型n值命题逻辑系统和R0型模糊命题逻辑系统中提出了公式的随机真度和随机距离的概念,建立了随机度量空间.指出当取均匀概率时,随机真度就转化为计量逻辑学中的真度,从而建立了更一般的随机逻辑度量空间.  相似文献   

5.
在MV-代数全体赋值集Σ上建立拓扑D(称为赋值拓扑)并研究赋值拓扑的拓扑性质。证明赋值拓扑空间是紧Hausdorff拓扑。利用赋值拓扑的紧性证明Lukasiewicz命题逻辑系统和Lukasiewicz逻辑语义的紧性。  相似文献   

6.
罗清君  王国俊 《数学进展》2007,36(2):173-180
为在经典逻辑学中建立Fuzzy分离规则的推理模式,由赋值决定公式问题(简称VDF问题)已经提出,并已在二值命题逻辑L和p+1(p为素数)值Lukasiewicz命题逻辑中得到了解决,但是对一般的n+1(n〉3且n不是素数)值Lukasiewicz命题逻辑系统L(n+1),VDF问题相当复杂且尚未解决.本文尝试在一类特殊的n+1值Lukasiewicz命题逻辑系统L(n+1),即L(n+1)的赋值域W(n+1)的所有子代数在包含序下构成一个链中建立VDF问题的求解理论,并完满地解决了这类n+1值Lukasiewicz命题逻辑系统L(n+1)中的VDF问题.  相似文献   

7.
Lukasiewicz p+1值逻辑系统中VDF问题的解决   总被引:1,自引:0,他引:1  
为在经典逻辑学中建立Fuzzy分离规则的推理模式,由赋值决定公式问题(简称VDF问题)已经提出,并已于二值命题逻辑以及三值Lukasiewicz命题逻辑中得到了解决,但当w>3时,VDF问题相当复杂且尚未解决.本文完满地解决了当w=p+1(p为素数)时,Lukasiewicz逻辑系统Lp+1中的VDF问题.  相似文献   

8.
多值逻辑系统中公式的μ-真度理论   总被引:2,自引:0,他引:2  
通过在n值和模糊值命题逻辑系统的全体赋值集Ω上定义概率测度μ,定义了任一命题公式A在两种逻辑系统中统一的μ-真度,研究了公式的μ-真度的基本性质及对应的推理规则,定义了两公式间的三种μ-相似度和伪度量,建立了较广泛意义上的逻辑度量空间,指出当概率测度μ为均匀概率测度时为计量逻辑学中的逻辑度量空间,最后提出理论的μ-发散度并得到理论的μ-发散度的计算公式.  相似文献   

9.
Lukasiewiczlz p+1值逻辑系统中VDF问题的解决   总被引:2,自引:1,他引:1  
宋玉靖 《数学进展》2004,33(5):607-614
为在经典逻辑学中建立Fuzzy分离规则的推理模式,由赋值决定公式问题(简称VDF问题)已经提出,并已于二值命题逻辑以及三值Lukasiewicz命题逻辑中得到了解决,但当w>3时,VDF问题相当复杂且尚未解决.本文完满地解决了当w=p+1(p为素数)时,Lukasiewicz逻辑系统Lp+1中的VDF问题.  相似文献   

10.
Boole代数上的度量结构及其在命题逻辑中的应用   总被引:18,自引:3,他引:15  
设B是一个Boole代数, Ω是从B到Boole代数{0,1}的全体同态之集,μ是Ω上的概率测度.本文基于μ在B中引入了元素的尺寸概念以及元素对之间的相似度概念,并由此在B上建立了度量结构.作为应用,本文改进了新近提出的命题逻辑中的近似推理理论.  相似文献   

11.
引入了本原无限布尔方阵的概念,给出了对称无限布尔方阵为本原阵的一个充分必要条件,最后给出了对称本原无限布尔方阵的本原指数的一个计算公式.  相似文献   

12.
A formula for the mean-value distribution of certain meromorphic functions on a vertical line s = σ +iR under a generalized Boolean transformation, called rational Boolean transformation from R into itself, is derived using Birkhoff 's ergodic theorem. This formula is represented as a computable integral. Using the Cauchy's integral theorem, values of this integral corresponding to various possible cases are explicitly computed.  相似文献   

13.
布尔函数的代数免疫度是在流密码的代数攻击中所产生的重要概念.研究了代数免疫度为1的布尔函数,得到的主要结果有:对代数免疫度为1的布尔函数给出了一个谱刻画,给出了其个数的精确计数公式,最后给出了此类函数的非线性度的紧的上界.  相似文献   

14.
We generalize to the arithmetic Walsh transform (AWT) some results which were previously known for the Walsh–Hadamard transform of Boolean functions. We first generalize the classical Poisson summation formula to the AWT. We then define a generalized notion of resilience with respect to an arbitrary statistical measure of Boolean functions. We apply the Poisson summation formula to obtain a condition equivalent to resilience for one such statistical measure. Last, we show that the AWT of a large class of Boolean functions can be expressed in terms of the AWT of a Boolean function of algebraic degree at most three in a larger number of variables.  相似文献   

15.
The following problem is considered: given a Boolean formula f, generate another formula g such that: (i) If f is unsatisfiable then g is also unsatisfiable. (ii) If f is satisfiable then g is also satisfiable and furthermore g is “easier” than f. For the measure of this easiness, we use the density of a formula f which is defined as (the number of satisfying assignments)/2n, where n is the number of Boolean variables of f. In this paper, we mainly consider the case that the input formula f is given as a 3-CNF formula and the output formula g may be any formula using Boolean AND, OR and negation. Two different approaches to this problem are presented: one is to obtain g by reducing the number of variables and the other by increasing the number of variables, both of which are based on existing SAT algorithms. Our performance evaluation shows that, a little surprisingly, better SAT algorithms do not always give us better density-condensation algorithms.  相似文献   

16.
It is proved that values of Shannon functions in the class of polarized polynomial forms (generalized Reed-Muller forms) coincide for classes of all Boolean functions and all symmetric Boolean functions; a formula computing estimates for these functions is derived. Translated fromAlgebra i Logika, Vol. 34, No. 3, pp. 323-326, May-June, 1995.  相似文献   

17.
The authors generalize the classical interpolation formula for Boolean functions of n variables. A characterization of all interpolating systems with 2n elements is obtained. The methods of proof used are intimately related to the solution of linear Boolean equations.  相似文献   

18.
布尔矩阵的幂敛指数集   总被引:5,自引:0,他引:5  
周波  柳柏濂 《数学进展》1999,28(5):431-436
给出了不含非零对角元的n阶布尔矩阵的幂敛指数集的明显表达式,从而完全解决了布尔矩阵依赖于非零对角元个数的幂敛指数集的刻画问题。  相似文献   

19.
A problem of realization of Boolean functions by α-formulas is considered. These formulas are such that each subformula contains not more than one nontrivial principal subformula. The depth is considered as a complexity measure of a formula. Upper and lower polynomial estimates of Shannon functions for α-completions of finite systems of Boolean functions are obtained.  相似文献   

20.
We consider repetition-free Boolean functions in the basis {&, ∨, ⊕, ?}, and prove a formula expressing the number of such functions of n variables as a product of Fibonacci numbers. These products are estimated; as a result, we obtain asymptotic estimates for the number of repetition-free Boolean functions. These estimates involve Euler numbers of second order and can be reduced by well-known methods to the form of an exponential-power series. These estimates can be used to construct the final asymptotics of the number of repetition-free Boolean functions in the full binary basis.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号