The settling-time reducibility ordering

DOI10.2178/JSL/1191333856MaRDI QIDQ5422318zbMATH OpenOpenAlexFDO

Authors Richard A. Shore, Barbara Csima

Publication date 17 October 2007

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.jsl/1191333856, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.5340

zbMATH Keywords

computably enumerable setenumerationsettling-time reducibility ordering

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• Comparing C.E. Sets Based on Their Settling Times
• The Settling Time Reducibility Ordering and  Formula Sets
• Order-computable sets
• Computability Results Used in Differential Geometry
• RECURSIVELY ENUMERABLE SETS AND WELL-ORDERING OF THEIR ENUMERATIONS

Cites work

• Computability Results Used in Differential Geometry
• Computability Theory and Differential Geometry
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 225477 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• The fractal nature of Riem/Diff. I.

Cited in

(4)

• Computability Results Used in Differential Geometry
• The Settling Time Reducibility Ordering and  Formula Sets
• Comparing C.E. Sets Based on Their Settling Times
• Comparison of Dual Orderings in Time II

This page was built for publication: The settling-time reducibility ordering

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