Definable Filters in the Structure of Bounded Turing Reductions,10.1007/978-3-540-79228-4_10,Angsheng Li,Weilin Li,Yicheng Pan,Linqing Tang

Definable Filters in the Structure of Bounded Turing Reductions (Citations: 1)


	BibTex \| RIS \| RefWorks Download

, , ,

In this article, we show that there exist c.e. bounded Turing degrees a\textbf{a} , b\textbf{b} such that 0 ′ , and that for any c.e. bounded Turing degree x\textbf{x} , bÚ</font >x=0¢</font >{\bf b\lor x=0^{'}} if and only if x ³</font > a\textbf{x}\geq\textbf{a} . The result gives an unexpected definability theorem in the structure of bounded Turing reducibilities.

Conference: Theory and Applications of Models of Computation - TAMC , pp. 116-124, 2008

DOI: 10.1007/978-3-540-79228-4_10

Cumulative Annual

View Publication

( www.springerlink.com )

( dx.doi.org )

Keywords (1)

Definable Filters in the Structure of Bounded Turing Reductions,10.1007/978-3-540-79228-4_10,Angsheng Li,Weilin Li,Yicheng Pan,Linqing Tang

References (6)

Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices (Citations: 5)

The Continuity of Cupping to 0 (Citations: 5)

Continuity of capping in CbT (Citations: 1)

The Undecidability of the Pi4Theory for the R. E. WTT and Turing Degrees (Citations: 2)

Contributions to Recursion Theory (Citations: 5)

Citations (1)

Continuity of capping in CbT (Citations: 1)


	The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.