COMPLEXITY OF THE PROBLEM OF BEING EQUIVALENT TO HORN FORMULAS

被引：2
|
作者：
Kogabaev, N. T. [1 ]
机构：
[1] Sobolev Inst Math, Novosibirsk, Russia
来源：
ALGEBRA AND LOGIC | 2022年 / 60卷 / 06期
关键词：
Horn formula; m-reducibility; Sigma(0)(1) set; REDUCTION METHOD;
D O I：
10.1007/s10469-022-09665-z
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We look at the complexity of the existence problem for a Horn sentence (identity, quasi-identity, for all-sentence, there exists-sentence) equivalent to a given one. It is proved that if the signature contains at least one symbol of arity k >= 2, then each of the problems mentioned is an m-complete Sigma(0 )(1)set.
引用
收藏
页码：380 / 388
页数：9
相关论文
共 50 条
12345