Decidability conjecture for the two-variable, one-unary-predicate fragment of QS5
Statement
Let 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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.