How Hard Is Positive Quantification?
From MaRDI portal
Publication:5278190
DOI10.1145/2981544zbMath1367.03021OpenAlexW2547321601MaRDI QIDQ5278190
Aleksy Schubert, Paweł Urzyczyn, Daria Walukiewicz-Chrząszcz
Publication date: 13 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2981544
Automata and formal grammars in connection with logical questions (03D05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (1)
Uses Software
Cites Work
- Lectures on the Curry-Howard isomorphism
- Descriptive characterizations of computational complexity
- Isabelle/HOL. A proof assistant for higher-order logic
- Theory of computation.
- Eigenvariables, bracketing and the decidability of positive minimal predicate logic
- Sovability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers
- Advances in the Formalization of the Odd Order Theorem
- A Brief Overview of Agda – A Functional Language with Dependent Types
- The Four Colour Theorem: Engineering of a Formal Proof
- Proof Search and Counter Model of Positive Minimal Predicate Logic
- Translations on a context free grammar
- On the Mints Hierarchy in First-Order Intuitionistic Logic
This page was built for publication: How Hard Is Positive Quantification?
