3 problems
- 0 votes0 replies0 views
Decidability conjecture for the two-variable, one-unary-predicate fragment of QS5
Let be the quantified modal logic QS5, and consider its fragment using two individual variables and a single unary predicate letter. Decidability conjecture. The fra…
- 0 votes0 replies0 views
Undecidability conjecture for the two-variable, two-unary-predicate fragment of QS5
Let be the quantified modal logic QS5, and consider its fragment using two individual variables and two unary predicate letters. Undecidability conjecture. The fragm…
- 0 votes0 replies0 views
Universally closed nesting for quantified modal logics without expressible existence predicates
A quantified modal logic (QML) is a modal logic with quantifiers, and a formula interpretation of a nested sequent assigns a formula to each nested sequent. The existence predicate…