共查询到18条相似文献,搜索用时 81 毫秒
1.
2.
3.
扰动模糊命题逻辑的代数结构及其广义重言式性质 总被引:5,自引:1,他引:4
着眼于扰动模糊命题逻辑的代数结构,为研究二维扰动模糊命题逻辑最大子代数I2R及其广义重言式提供了一些代数理论基础,最后研究了子代数间广义重言式的关系. 相似文献
4.
5.
系统RDP中的广义重言式理论 总被引:1,自引:0,他引:1
研究带参数的模糊逻辑系统RDP中的广义重言式理论.结果表明系统RDP中只有三种不同的广义重言式,即(1/2),重言式,(1/2)+-重言式和重言式.将一些多值逻辑系统和模糊逻辑系统中行之有效的升级算法运用于系统RDP,证明在该系统中,升级算法可以将可迭0-重言式和可达(1/2)-重言式分别提升为可这(1/2)-重言式和可达(1/2)+-重言式,但是,对可达(1/2)+-重言式升级算法的结果仍然得到可达(1/2)+-重言式.这表明对非重言式有限次利用升级算法未必能得到重言式. 相似文献
6.
7.
首先证明了在修正的Product逻辑系统中广义重言式有更加精细的区分;其次通过引入一类特殊的公式序列和特殊公式,进一步证明了对任意有理数a∈[0,1],可达α-重言式集是类类非空的,并同时给出了修正的Product逻辑系统中广义重言式的升级算法。 相似文献
8.
9.
首先建立了非可换R_0t-模,以此为语义背景将模糊逻辑形式系统L~*拓广到非可换情形,提出了新的模糊逻辑形式系统PL~*,证明了系统PL~*的可靠性定理.其次,引入PL~*-代数及其滤子概念,得到PL~*-代数的正规素滤子定理,借此证明了PL~*系统的完备性.最后说明了PR_0t-模及PL~*系统可能的应用方向. 相似文献
10.
首先建立了非可换R_0t-模,以此为语义背景将模糊逻辑形式系统L~*拓广到非可换情形,提出了新的模糊逻辑形式系统PL~*,证明了系统PL~*的可靠性定理.其次,引入PL~*-代数及其滤子概念,得到PL~*-代数的正规素滤子定理,借此证明了PL~*系统的完备性.最后说明了PR_0t-模及PL~*系统可能的应用方向. 相似文献
11.
积逻辑系统中的广义重言式 总被引:15,自引:2,他引:13
讨论积逻辑系统中的广义重言式理论 ,给出积逻辑系统中子代数和广义重言式的一系列性质。本文的主要结果表明 ,在几个重要的逻辑系统中 ,标准积逻辑系统具有最简单的广义重言式结构 ,而在推理过程中 ,它具有较差的真值传递性。 相似文献
12.
This paper focuses on hierarchical structures of formulas in fuzzy logical systems. Basic concepts and hierarchical structures of generalized tautologies based on a class of fuzzy logical systems are discussed. The class of fuzzy logical systems contains the monoidal t-norm based system and its several important schematic extensions: the ?ukasiewicz logical system, the Gödel logical system, the product logical system and the nilpotent minimum logical system. Furthermore, hierarchical structures of generalized tautologies are applied to discuss the transformation situation of tautological degrees during the procedure of fuzzy reasoning. 相似文献
13.
区间值模糊命题逻辑系统的广义恒真式 总被引:5,自引:1,他引:4
建立区间值模糊命题逻辑系统F(∨,∧,σ┴,c),其中,α^-θ┴b=(α^-)^c┴b^-,┴是I[0,1]中的t-余范;讨论系统F(∨,∧,σ┴,c)与对应的模糊命题逻辑系统F(∨,∧,σ┴,c)在广义恒真式方面的相互关系,得到定理:T^-[0,α](F^-∨,∧,σ┴,c)=Tα(F(∨,∧,σ┴,c))。 相似文献
14.
The dynamics of a single strain HIV model is studied.The basic reproduction number R_0 used as a bifurcation parameter shows that the system undergoes transcritical and saddle-node bifurcations.The usual threshold unit value of R_0 does not completely determine the eradication of the disease in an HIV infected person.In particular,a sub-threshold value R_C is established which determines the system's number of endemic states:multiple if R_c Ro 1,only one if R_C = R_0 = 1,and none if R_0 R_C 1. 相似文献
15.
Siegfried Gottwald 《Fuzzy Sets and Systems》1980,3(2):181-192
Fuzzy logic ∞9 considered in connection with fuzzy sets theory, is a special theory, is a special many valued logic with truth-value sets [0, 1], which has been studied already by Lukasiewicz. We consider also his versions m for m ? 2 with finite truth-value sets. In all cases we add two further propositional connectives, one conjunction and one disjunction. For these logics we give a list of tautologies, consider relations between their sets of tautologies, prove their compactness, and mention some further results. 相似文献
16.
随机微分方程dX_t=(δf~2(t)-h(t)X_t)dt+2f(t) │X_t│~(1/2)dBt,(X_0=x,δ>0)的解X_t是一种推广的δ(δ>0)维Bessel过程.文章对于任意停时τ给出了‖sup0≤t≤τη(t)X_t‖p的L~p估计,其中η:R_+→R_+是一个R+上的可微函数,而且满足微分方程dη/dt-h(t)η=-η~2f~2(t),η(0)=1. 相似文献
17.
讨论了具有垂直传染且总人口在变化的连续预防接种SIRS传染病模型,给出了基本再生数R_0的表达式,并利用广义Bendixson-Dulac函数方法证明了无病平衡点和地方病平衡点的全局稳定性. 相似文献
18.
Emil Jeřábek 《Annals of Pure and Applied Logic》2017,168(1):150-190
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF) or substitution Frege (SF) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC polynomially simulate full intuitionistic logic for implicational tautologies. The results also apply to other fragments of other superintuitionistic logics under certain conditions.In particular, the exponential lower bounds on the length of intuitionistic EF proofs by Hrube? (2007), generalized to exponential separation between EF and SF systems in superintuitionistic logics of unbounded branching by Je?ábek (2009), can be realized by implicational tautologies. 相似文献