ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let QS5\mathbf{QS5} be the quantified modal logic QS5, and consider its fragment using two individual variables and a single unary predicate letter. Decidability conjecture. The fragment of QS5\mathbf{QS5} in the language with two individual variables and a single unary predicate letter is algorithmically decidable. This is presented as a remaining question in the algorithmic complexity of quantified modal fragments, following the known undecidability results for related fragments with either more individual variables or more unary predicate letters.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.