A weak constructive second-order arithmetic with extraction of algorithms computable in polynomial time

DOI10.1007/S10958-005-0351-4zbMATH Open1145.03338OpenAlexW2074013392MaRDI QIDQ937902

Anatoly Petrivich Beltiukov

Publication date: 18 August 2008

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-005-0351-4

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Intuitionistic formal theories with realizability in subrecursive classes

Related Items (1)

A second step toward the strong polynomial-time hierarchy

This page was built for publication: A weak constructive second-order arithmetic with extraction of algorithms computable in polynomial time

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