On the Mints Hierarchy in First-Order Intuitionistic Logic

DOI10.1007/978-3-662-46678-0_29zbMath1459.03009arXiv1610.02675OpenAlexW340875578MaRDI QIDQ5892211

Aleksy Schubert, Paweł Urzyczyn, Konrad Zdanowski

Publication date: 1 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.02675

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (3)

How Hard Is Positive Quantification? ⋮ An intuitionistic formula hierarchy based on high‐school identities ⋮ On the Mints Hierarchy in First-Order Intuitionistic Logic

Uses Software

• Isabelle/HOL

This page was built for publication: On the Mints Hierarchy in First-Order Intuitionistic Logic