paper

Algorithmic properties of QK4.3 and QS4.3

arXiv:2307.02800

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.

Smirnov Readings, 2021, Moscow

Algorithmic properties of QK4.3 and QS4.3 · wovepaper