scientific article; zbMATH DE number 3930992

MaRDI QIDQ3705441zbMATH OpenFDO

Authors Angel V. Ditchev

Publication date 1985

Full work available at URL https://eudml.org/doc/187320

zbMATH Keywords

admissibilityadmissible functionsearch computabilitysearch computable functionSkordev's conjecture

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• D. Skordev's hypothesis
• scientific article; zbMATH DE number 4105953
• On a hypothesis of G. A. Sviridyuk
• scientific article; zbMATH DE number 4183778
• scientific article; zbMATH DE number 4056430
• On the Skitovich-Darmois-Ramachandran theorem
• On the Lindelöf hypothesis
• On a theory by Schechter and Tintarev
• scientific article; zbMATH DE number 741360
• scientific article; zbMATH DE number 3448651

Cited in

(7)

• Around Borsuk's hypothesis
• Characterization of the effective computability in \({\mathfrak f}\)-enumerations
• Admissible functionals in abstract structures with arbitrary power
• Definability via enumerations
• Exact effective enumerations of total functional structures
• Least enumerations of unary partial structures
• Some properties of an algebra of all sets of naturals e-reducible to a fixed set

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 Q3705441)