Algorithmic properties of QK4.3 and QS4.3
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.
READ FULL TEXTWe 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.
READ FULL TEXTUse your Google Account to sign in to DeepAI