Algorithmic properties of QK4.3 and QS4.3
From MaRDI portal
Publication:6442795
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.
This page was built for publication: Algorithmic properties of QK4.3 and QS4.3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6442795)
