Tiling problems and complexity of logics (extended version)
From MaRDI portal
Publication:6441307
Abstract: We apply domino problems to give short proofs for some known theorems for the classical predicate logic and to obtain lower bounds for complexity of modal predicate logics defined by Noetherian orders as Kripke frames.
This page was built for publication: Tiling problems and complexity of logics (extended version)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6441307)
