一种求Ramsey数的命题演算法

A Propositional Calculus Method to Find Ramsey Numbers

首先在矩阵中用谓词描述“含 Kn”和“含 Km”,然后通过命题演算法逐行求出不含 Kn也不含 Km的矩阵 (aij) i=1,2 ,… ,l-1j=i+ 1,… ,l .若对于 l≤ r- 1有这样的矩阵 ,而对于 l =r却没有 ,则

The 'include K\-n and \-m' in a matrix are firstly described by predicate. Then the matrix (a ij) i=1,2,...,l-1 j=i+1,...,l that include neither K\-n,nor \-m,is found by a prepositional calculus in row by row. If there are the matrixes for l≤r-1,but there is no the matrix for l=r,then r is Ramsey number.