The Settling Time Reducibility Ordering and Formula Sets

DOI10.1093/LOGCOM/EXN031zbMath1163.03022OpenAlexW2279493147MaRDI QIDQ3611725

Barbara F. Csima

Publication date: 2 March 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn031

zbMATH Keywords

computability theorycomputable approximations\({\Delta}^0_2\) sets

Mathematics Subject Classification ID

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

This page was built for publication: The Settling Time Reducibility Ordering and  Formula Sets