Tiling problems and complexity of logics (extended version)
Logic
2023-06-27 v1
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.
Keywords
Cite
@article{arxiv.2306.13736,
title = {Tiling problems and complexity of logics (extended version)},
author = {M. Rybakov and D. Serova},
journal= {arXiv preprint arXiv:2306.13736},
year = {2023}
}
Comments
The paper is an extended version of the abstracts submitted to the conference Semantical and Computational Aspects of Non-Classical Logics (Moscow + Online, June 13-17, 2023), Steklov International Mathematical Center, Moscow, 2023