Focussing, MALL and the polynomial hierarchy

DOI10.1007/978-3-319-94205-6_45zbMATH Open1468.68103OpenAlexW2809834569MaRDI QIDQ1799136FDOQ1799136

Authors: Anupam Das 

Publication date: 18 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94205-6_45

Recommendations

• From QBFs to \textsf{MALL} and back via focussing
• Focusing and polarization in linear, intuitionistic, and classical logics
• The focused calculus of structures
• Decision problems for propositional linear logic
• Focusing and Polarization in Intuitionistic Logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cited In (1)

• From QBFs to \textsf{MALL} and back via focussing

This page was built for publication: Focussing, \(\mathsf{MALL}\) and the polynomial hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799136)