On the Mints Hierarchy in First-Order Intuitionistic Logic
Logic in Computer Science
2019-03-14 v3
Abstract
We stratify intuitionistic first-order logic over into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these fragments. We prove that even the level is undecidable and that is Expspace-complete. We also prove that the arity-bounded fragment of is complete for co-Nexptime.
Cite
@article{arxiv.1610.02675,
title = {On the Mints Hierarchy in First-Order Intuitionistic Logic},
author = {Aleksy Schubert and Paweł Urzyczyn and Konrad Zdanowski},
journal= {arXiv preprint arXiv:1610.02675},
year = {2019}
}