From positive and intuitionistic bounded arithmetic to monotone proof complexity

DOI10.1145/2933575.2934570zbMath1395.03030OpenAlexW2530146152MaRDI QIDQ4635868

Anupam Das

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/81113090/From_positive.pdf

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Subsystems of classical logic (including intuitionistic logic) (03B20) Complexity of proofs (03F20)

Related Items (1)

A recursion-theoretic characterisation of the positive polynomial-time functions

This page was built for publication: From positive and intuitionistic bounded arithmetic to monotone proof complexity