scientific article; zbMATH DE number 2154080

MaRDI QIDQ4664627zbMATH OpenFDO

Authors I. V. Ashaev

Publication date 8 April 2005

zbMATH Keywords

generalized computabilityreduction principleuniformization principle

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)

Recommendations

• On the uniform computational content of computability theory
• Toward a generalized computability theory
• Uniformity, universality, and computability theory
• On notions of computability-theoretic reduction between Π21 principles
• scientific article; zbMATH DE number 2167522
• Generalized theorems on relationships among reducibility notions to certain complexity classes
• scientific article; zbMATH DE number 4033724
• The Uniformity Principle for Σ-Definability with Applications to Computable Analysis
• Computability theory of generalized functions
• scientific article; zbMATH DE number 3858462

Cited in

(6)

• On notions of computability-theoretic reduction between Π21 principles
• Universality, Reducibility, and Completeness
• scientific article; zbMATH DE number 4037175 (Why is no real title available?)
• scientific article; zbMATH DE number 4043254 (Why is no real title available?)
• Computability in special models
• Algebra and Coalgebra in Computer Science

This page was built for publication:

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