On the Relationship Between the Complexity of Decidability and Decomposability of First-Order Theories

被引:0
|
作者
D. Ponomaryov
机构
[1] Ershov Institute of Informatics Systems,
[2] Novosibirsk State University,undefined
来源
Lobachevskii Journal of Mathematics | 2021年 / 42卷
关键词
decomposition; decidability; computational complexity;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:2905 / 2912
页数:7
相关论文
共 50 条