Undecidability conjecture for the two-variable, two-unary-predicate fragment of QS5
Statement
Let be the quantified modal logic QS5, and consider its fragment using two individual variables and two unary predicate letters. Undecidability conjecture. The fragment of in the language with two individual variables and two unary predicate letters is algorithmically undecidable. This would settle one of the remaining decidability questions for small-variable, small-signature fragments of quantified modal logics; the paper notes that the corresponding fragment with three individual variables and one unary predicate letter, and with two individual variables and three unary predicate letters, is already undecidable.
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.