October 16, 2025Open Access

Reopening of the conjecture about the decidability of Quasi-Dense Modal Logics (Comments on Lyon & Ostropolski-Nalewaja's result)

View Full Paper

Ask AI

Bookmark

The decidability of quasi-dense modal logics remains open despite prior claims, indicating deeper complexities.
An upper bound in EXPSPACE was proposed, but significant issues in the proof undermine its reliability.
The work of Lyon & Ostropolski-Nalewaja introduced major questions that require further exploration in modal logics.
Flaws identified in existing proofs highlight potential gaps in understanding quasi-dense logics and their implications.

Implication

Comments address flaws in the proof of the decidability of quasi-dense modal logics, suggesting implications for ongoing research.

Abstract

In {Lyon24} the question of the decidability of quasi-dense modal logics is answered, and an upper bound in is given. Unfortunately, authors' intricate proof seems to contain a major flaw that cannot be fixed, leaving the question wide open.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Olivier Gasquet (2025) studied this question.

synapsesocial.com/papers/68f0f51d8dd8ea469b1d6fbd https://doi.org/10.48550/arxiv.2507.11644

View Full Paper

Ask AI

Bookmark

Implication

Comments address flaws in the proof of the decidability of quasi-dense modal logics, suggesting implications for ongoing research.

Reopening of the conjecture about the decidability of Quasi-Dense Modal Logics (Comments on Lyon & Ostropolski-Nalewaja's result)

Key Points

Implication

Abstract

Discussion

Cite This Study

Reopening of the conjecture about the decidability of Quasi-Dense Modal Logics (Comments on Lyon & Ostropolski-Nalewaja's result)

Key Points

Implication

Abstract

Discussion

Cite This Study

Keep reading

Keep reading