Type 2 polynomial hierarchies

DOI10.1007/3-540-60178-3_89MaRDI QIDQ6064286zbMATH OpenFDO

Authors Anil K. Seth

Publication date 12 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60178-3_89

zbMATH Keywords

existential quantificationfaithful typefinite typefunctional compositionorder polynomial

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Complexity for type-2 relations
• A new Characterization of Type-2 Feasibility
• Polynomial-time hierarchies on some classes of functions. II
• Structural properties for feasibly computable classes of type two

Cites work

• Complexity for type-2 relations
• Functional interpretations of feasibly constructive arithmetic
• scientific article; zbMATH DE number 4059391 (Why is no real title available?)
• scientific article; zbMATH DE number 4066875 (Why is no real title available?)
• scientific article; zbMATH DE number 65741 (Why is no real title available?)
• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 806755 (Why is no real title available?)
• Provably total functions of intuitionistic bounded arithmetic
• The polynomial-time hierarchy

This page was built for publication: Type 2 polynomial hierarchies

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