Some applications of logic to feasibility in higher types

DOI10.1145/976706.976713zbMath1407.03058OpenAlexW2170846453MaRDI QIDQ5277700

Arun Sharma, Aleksandar Ignjatović

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/976706.976713

zbMATH Keywords

bounded arithmeticfunctionalssecond-order theorieshigher-order complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Second- and higher-order arithmetic and fragments (03F35) Higher-type and set recursion theory (03D65)

Related Items (1)

Type-two polynomial-time and restricted lookahead

This page was built for publication: Some applications of logic to feasibility in higher types