SOME NON-RECURSIVE CLASSES OF THUE SYSTEMS WITH SOLVABLE WORD PROBLEM

被引:3
作者
YASUHARA, A
机构
来源
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK | 1974年 / 20卷 / 02期
关键词
D O I
10.1002/malq.19740200803
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:121 / 132
页数:12
相关论文
共 20 条
[1]  
[Anonymous], 2004, COMBINATORIAL GROUP
[3]  
BOONE WW, 1966, MATH SCAND, V19, P185
[4]  
Clifford A. H., 1967, ALGEBRAIC THEORY SEM, VII
[5]  
Davis M., 1958, COMPUTABILITY UNSOLV
[6]  
Davis M.D, 1956, NOTE UNIVERSAL TURIN, P167
[7]   A SIMPLE SOLUTION OF UNIFORM HALTING PROBLEM [J].
HERMAN, GT .
JOURNAL OF SYMBOLIC LOGIC, 1969, 34 (04) :639-&
[8]   UNDECIDABILITY OF TURING MACHINE IMMORTALITY PROBLEM [J].
HOOPER, PK .
JOURNAL OF SYMBOLIC LOGIC, 1966, 31 (02) :219-&
[9]  
KLEENE SC, 1952, INTRO METAMATHEMATIC
[10]  
MARKOV A. A., 1961, THEORY ALGORITHMS