Algorithmic properties of QK4.3 and QS4.3
Abstract
We prove that predicate modal logics QK4.3 and QS4.3 are undecidable in languages with two individual variables, one modandic predicate letter, and one proposition letter.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.