Undecidability of admissibility in the product of two Alt logics

&
Logic Journal of the IGPL 33 (1):62-73 (2025)
  Copy   BIBTEX

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.

Categories

Keywords

Reprint years

DOI

10.1093/jigpal/jzad021

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Undecidability of Algebras of Binary Relations.Robin Hirsch, Ian Hodkinson & Marcel Jackson - 2021 - In Judit Madarász & Gergely Székely (eds.), Hajnal Andréka and István Németi on Unity of Science: From Computing to Relativity Theory Through Algebraic Logic. Springer. pp. 267-287.
Products of 'transitive' modal logics.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2005 - Journal of Symbolic Logic 70 (3):993-1021.
On modal logics between K × K × K and $s5 \times s5 \times s5$.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221 - 234.
On modal logics between K × K × K and s5 × s5 × S.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221-234.
The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines.C. Hampson, S. Kikot & A. Kurucz - 2016 - Studia Logica 104 (3):455-486.
Remarks about the unification types of some locally tabular normal modal logics.Philippe Balbiani, ÇiĞdem Gencer, Maryam Rostamigiv & Tinko Tinchev - 2023 - Logic Journal of the IGPL 31 (1):115-139.
On modal logics between {$\roman K\times\roman K\times \roman K$} and {${\rm S}5\times{\rm S}5\times{\rm S}5$}.Robin Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221-234.
Most Simple Extensions of Are Undecidable.Nikolaos Galatos & Gavin St John - 2022 - Journal of Symbolic Logic 87 (3):1156-1200.

Analytics

Added to PP
2023-10-28

Downloads
17 (#1,153,842)

6 months
4 (#1,252,858)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.
Modal logic.Yde Venema - 2000 - Philosophical Review 109 (2):286-289.
Products of modal logics, part 1.D. Gabbay & V. Shehtman - 1998 - Logic Journal of the IGPL 6 (1):73-146.
Best solving modal equations.Silvio Ghilardi - 2000 - Annals of Pure and Applied Logic 102 (3):183-198.

View all 13 references / Add more references