Undecidability of admissibility in the product of two Alt logics
LOGIC JOURNAL OF THE IGPL(2023)
摘要
The product of two $\textbf {Alt}$ logics possesses the polynomial product finite model property and its membership problem is $\textbf {coNP}$-complete. Using a reduction from an undecidable domino-tiling problem, we prove that its admissibility problem is undecidable.
更多查看译文
关键词
alt logics,admissibility
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要