Undecidability of admissibility in the product of two Alt logics

IF 0.6 4区数学 Q2 LOGIC

Logic Journal of the IGPL Pub Date : 2023-10-25 DOI:10.1093/jigpal/jzad021

Philippe Balbiani, Çiğdem Gencer

引用次数: 0

Abstract

Abstract 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逻辑乘积中可采性的不可判定性

摘要两个$\textbf {Alt}$逻辑的乘积具有多项式积有限模型性质，其隶属度问题$\textbf {coNP}$-完全。利用一个不可判定的多米诺问题的约简，证明了其可容许性问题是不可判定的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Logic Journal of the IGPL 数学-数学

CiteScore

2.60

自引率

10.00%

发文量

审稿时长

6-12 weeks

期刊介绍： Logic Journal of the IGPL publishes papers in all areas of pure and applied logic, including pure logical systems, proof theory, model theory, recursion theory, type theory, nonclassical logics, nonmonotonic logic, numerical and uncertainty reasoning, logic and AI, foundations of logic programming, logic and computation, logic and language, and logic engineering. Logic Journal of the IGPL is published under licence from Professor Dov Gabbay as owner of the journal.