Undecidability of admissibility in the product of two Alt logics

&
Logic Journal of the IGPL (forthcoming)
  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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

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

Inference Rules in Nelson’s Logics, Admissibility and Weak Admissibility.Sergei Odintsov & Vladimir Rybakov - 2015 - Logica Universalis 9 (1):93-120.
An Algebraic Proof of the Admissibility of γ in Relevant Modal Logics.Takahiro Seki - 2012 - Studia Logica 100 (6):1149-1174.
The γ-admissibility of Relevant Modal Logics II — The Method using Metavaluations.Takahiro Seki - 2011 - Studia Logica 97 (3):351-383.
Admissibility in Positive Logics.Alex Citkin - 2017 - Logica Universalis 11 (4):421-437.
The γ-admissibility of Relevant Modal Logics I — The Method of Normal Models.Takahiro Seki - 2011 - Studia Logica 97 (2):199-231.
Axiomatization and completeness of lexicographic products of modal logics.Philippe Balbiani - 2011 - Journal of Applied Non-Classical Logics 21 (2):141-176.
The γ-admissibility of Relevant Modal Logics I — The Method of Normal Models.Takahiro Seki - 2011 - Studia Logica 97 (2):199-231.
On Finite Model Property for Admissible Rules.Vladimir V. Rybakov, Vladimir R. Kiyatkin & Tahsin Oner - 1999 - Mathematical Logic Quarterly 45 (4):505-520.
Unification in epistemic logics.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):91-105.
Undecidability and Non-Axiomatizability of Modal Many-Valued Logics.Amanda Vidal - 2022 - Journal of Symbolic Logic 87 (4):1576-1605.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property.Vladimir V. Rybakov - 1994 - Studia Logica 53 (2):203 - 225.
The Incompleteness of S4 {bigoplus} S4 for the Product Space.Philip Kremer - 2015 - Studia Logica 103 (1):219-226.
The incompleteness of s4 ⊕ s4 for the product space R × R.Philip Kremer - unknown
Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness.Mikhail Rybakov - forthcoming - Logic Journal of the IGPL.

Analytics

Added to PP
2023-10-28

Downloads
12 (#1,092,565)

6 months
9 (#320,673)

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, Alexander Chagrov & Michael Zakharyaschev - 2000 - Philosophical Review 109 (2):286.
Products of modal logics, part 1.D. Gabbay & V. Shehtman - 1998 - Logic Journal of the IGPL 6 (1):73-146.
Unification in modal and description logics.Franz Baader & Silvio Ghilardi - 2011 - Logic Journal of the IGPL 19 (6):705-730.

View all 13 references / Add more references