License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TYPES.2014.251
URN: urn:nbn:de:0030-drops-55002
Go to the corresponding LIPIcs Volume Portal

Schubert, Aleksy ; Urzyczyn, Pawel ; Walukiewicz-Chrzaszcz, Daria

Restricted Positive Quantification Is Not Elementary

14.pdf (0.6 MB)


We show that a restricted variant of constructive predicate logic with positive (covariant) quantification is of super-elementary complexity. The restriction is to limit the number of eigenvariables used in quantifier introductions rules to a reasonably usable level. This construction suggests that the known non-elementary decision algorithms for positive logic may actually be best possible.

BibTeX - Entry

  author =	{Aleksy Schubert and Pawel Urzyczyn and Daria Walukiewicz-Chrzaszcz},
  title =	{{Restricted Positive Quantification Is Not Elementary}},
  booktitle =	{20th International Conference on Types for Proofs and Programs (TYPES 2014)},
  pages =	{251--273},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-88-0},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{39},
  editor =	{Hugo Herbelin and Pierre Letouzey and Matthieu Sozeau},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-55002},
  doi =		{10.4230/LIPIcs.TYPES.2014.251},
  annote =	{Keywords: constructive logic, complexity, automata theory}

Keywords: constructive logic, complexity, automata theory
Collection: 20th International Conference on Types for Proofs and Programs (TYPES 2014)
Issue Date: 2015
Date of publication: 12.10.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI