-
Views
-
Cite
Cite
Philippe Balbiani, Çiğdem Gencer, Undecidability of admissibility in the product of two Alt logics, Logic Journal of the IGPL, Volume 33, Issue 1, February 2025, Pages 62–73, https://doi.org/10.1093/jigpal/jzad021
- Share Icon Share
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.
© The Author(s) 2023. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: [email protected].
This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://dbpia.nl.go.kr/pages/standard-publication-reuse-rights)
Issue Section:
Articles
You do not currently have access to this article.