Kripke trick and decidability of monadic fragments of modal and superintuitionistic logics
From MaRDI portal
Publication:6442798
Abstract: We discuss the modifications of the Kripke trick simulating binary predicate letters of classical first-order formulas with monadic modal first-order formulas and the situations where the trick does not work. As a result, we obtain results on algorithmic upper bounds for monadic fragments of some modal and superintuitionistic first-order logics.
This page was built for publication: Kripke trick and decidability of monadic fragments of modal and superintuitionistic logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6442798)
