摘要
在Gainse Rescher逻辑系统 Gr,Gr,Sn 中的广义矛盾式之间建立了一种降级算法 ,并讨论了该降级算法的基本性质 .主要结果是 :在逻辑系统 Gr(Gr)中 ,矛盾式不可能由对非矛盾式进行有限次降级算法得到 ,在逻辑系统Sn 中 ,对任一公式最多次行n-
We establish a downgrade algorithm among generalized contradictions in Gainse Rescher logic system r, G r, S n. The basic properties of the downgrade algorithm are discussed. The main results of this paper are: (1) In logic system r(G r) , contradiction can not be get by using downgrade algorithm to non contradiction within finite times. (2) In logic system S n, contradiction can be gained by employing downgrade algorithm to an arbitrary formula at most n-1 times.
出处
《数学研究》
CSCD
2002年第1期60-64,共5页
Journal of Mathematical Study
