期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
句子指称的模型事实论 被引量:2
1
作者 周文华 《学术探索》 CSSCI 2012年第3期5-11,共7页
弗雷格主张句子的指称是真值,罗素主张句子的指称是事实,维特根斯坦认为句子的指称是事态,Barwise和J.Perry主张句子的指称是情境类型,陈晓平主张句子的指称是事件。但这些观点都面临较大困难,故本文提出句子指称的模型事实论(model-fac... 弗雷格主张句子的指称是真值,罗素主张句子的指称是事实,维特根斯坦认为句子的指称是事态,Barwise和J.Perry主张句子的指称是情境类型,陈晓平主张句子的指称是事件。但这些观点都面临较大困难,故本文提出句子指称的模型事实论(model-fact theory)。模型事实论主张:只有相对于一个模型才可以严格地谈句子的指称;如果一个句子在某个模型上有指称,则该句子的指称是该模型上的事实。对词也有类似的主张,即只有相对于一个模型才可以严格地谈词的指称;如果一个词在某个模型上有指称,则该词的指称是该模型中的对象。本文对此作了论证。并用这一观点解决了否定存在难题,且解决的方法不同于蒯因和A.P.Martinich。 展开更多
关键词 句子的指称 弹指证明 真值论 模型事实论 否定存在难题
下载PDF
Quantum cloning with multicopy in d-dimensions 被引量:3
2
作者 ZHANG WenHai YU LongBao +1 位作者 YANG Ming CAO ZhuoLiang 《Science China(Physics,Mechanics & Astronomy)》 SCIE EI CAS 2011年第12期2217-2224,共8页
The explicit transformations of the 1→ 3 optimal universal quantum cloning and the optimal phase-covariant quantum cloning in d-dimensions are presented, and the dimensionalities of their ancillary systems are both d... The explicit transformations of the 1→ 3 optimal universal quantum cloning and the optimal phase-covariant quantum cloning in d-dimensions are presented, and the dimensionalities of their ancillary systems are both d-dimensions. As d→∞ , their clone fidelities move toward 1/3, showing a classical limit for the fidelity of quantum cloning. Based on the reduction of the unitary transformation of quantum cloning, the transformation of the 1→M=d+1 optimal economical phase-covariant quantum cloning in d-dimensions is derived, and the clone fidelity is covered by the theoretical value. 展开更多
关键词 quantum cloning universal quantum cloning phase-covariant quantum cloning economical phase-covariant quantum cloning
原文传递
A FRAMEWORK FOR REAL-VALUED CIPHER SYSTEMS
3
作者 Zhaozhi ZHANG Nan JIANG 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2007年第4期486-491,共6页
Most cipher systems designed thus far are binary-valued or integer-valued cipher systems. Their security relies on the assumption that one-way functions exist. Though the existence of one-way functions has not been pr... Most cipher systems designed thus far are binary-valued or integer-valued cipher systems. Their security relies on the assumption that one-way functions exist. Though the existence of one-way functions has not been proved yet, most cryptographic researchers believe that one-way functions exist. In addition, many candidates for one-way functions have been proposed. Therefore, the key step for developing real-valued cipher systems is to define real one-way functions and to propose candidates for them. In this paper, based on computational complexity theory over the real field, we give two definitions of real one-way functions; one is for digital one-way functions and the other is for general one-way functions. Candidates for these two classes of one-way functions are also proposed. Moreover, we present two examples to demonstrate that the candidates for both digital one-way functions and general one-way functions can be applied to construct secure real-valued cipher systems. 展开更多
关键词 Computational complexity theory digital one-way function general one-way function real-valued cipher system.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部