Restricted Positive Quantification Is Not Elementary

DOI10.4230/LIPIcs.TYPES.2014.251zbMath1434.03021OpenAlexW2181947715MaRDI QIDQ5277980

Paweł Urzyczyn, Daria Walukiewicz-Chrząszcz, Aleksy Schubert

Publication date: 12 July 2017

Full work available at URL: https://www.mimuw.edu.pl/~alx/positivenonelem.pdf

zbMATH Keywords

complexityautomata theoryconstructive logic

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Mechanization of proofs and logical operations (03B35) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (2)

First-order Answer Set Programming as Constructive Proof Search ⋮ On the Mints Hierarchy in First-Order Intuitionistic Logic

This page was built for publication: Restricted Positive Quantification Is Not Elementary