Open least element principle and bounded query computation

DOI10.1007/3-540-48168-0_28MaRDI QIDQ4945240zbMATH OpenFDO

Authors Lev D. Beklemishev

Publication date 23 August 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48168-0_28

zbMATH Keywords

bounded formulasbounded minimum operatorelementary arithmeticelementary closure of a functionleast element principleopen formulassubrecursive arithmetic

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) First-order arithmetic and fragments (03F30)

Recommendations

• On Bounded Queries and Approximation
• Bounded queries, approximations, and the Boolean hierarchy
• Bounded queries to arbitrary sets
• On bounded query machines
• Some initial thoughts on bounded query computations over the reals
• scientific article; zbMATH DE number 1405575
• Nondeterministic bounded query reducibilities
• Bounding queries in the analytic polynomial-time hierarchy
• The complexity of querying indefinite data about linearly ordered domains
• Optimization of bound disjunctive queries with constraints

Cited in

(3)

• Elementary complexity and geometry of interaction
• scientific article; zbMATH DE number 2174388 (Why is no real title available?)
• Honest elementary degrees and degrees of relative provability without the cupping property

This page was built for publication: Open least element principle and bounded query computation

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