On the solvability of a subclass of the surányi reduction class
In [1] Dreben showed that the subclass K′ (described below) of the Suranyi reduction class is recursively solvable by showing that the subclass is finitely controllable; that is, by showing that any member S of K′ is satisfiable only if it is finitely satisfiable. Dreben's argument is very complex, but much of the complexity is due to his proving not merely solvability, but the deeper property of finite controllability. In the present note, by exploiting certain features of Dreben's technique, a simpler, direct proof of the solvability of K′ is obtained — that is, a proof in which the question of satisfiability in a finite domain plays no role.
Keyword(s):
1986 ◽
Vol 44
◽
pp. 482-483
Keyword(s):
1958 ◽
Vol 23
(12)
◽
pp. 2169-2174
◽
2012 ◽
Vol 112
(1)
◽
pp. 15-19
◽
Keyword(s):