Some properties of the upper semilattice of computable families of computably enumerable sets

2021 ◽  
Vol 60 (2) ◽  
pp. 195-209
Author(s):  
M. Kh. Faizrakhmanov
1998 ◽  
Vol 94 (1-3) ◽  
pp. 97-125 ◽  
Author(s):  
Leo Harrington ◽  
Robert I. Soare

Author(s):  
John Stillwell

This chapter explains why Σ‎0 1 formulas of Peano arithmetic (PA) capture all computably enumerable sets, as claimed by Alonzo Church's thesis from the previous chapter. This allows us to capture “computable analysis” in the language of PA, since computable sets and functions are definable in terms of computable enumerability. To justify the claim that Σ‎0 1 = “computably enumerable,” this chapter makes a thorough analysis of the concept of computation. It takes a precise, but intuitively natural, concept of computation and translates it into the language of PA. The chapter demonstrates that the translation is indeed Σ‎0 1, but with a slightly different (though equivalent) definition of Σ‎0 1.


2002 ◽  
Vol 67 (2) ◽  
pp. 679-696
Author(s):  
Russell Miller

AbstractWe define a property R(A0, A1) in the partial order of computably enumerable sets under inclusion, and prove that R implies that A0 is noncomputable and incomplete. Moreover, the property is nonvacuous. and the A0 and A1 which we build satisfying R form a Friedberg splitting of their union A, with A1 prompt and A promptly simple. We conclude that A0 and A1 lie in distinct orbits under automorphisms of , yielding a strong answer to a question previously explored by Downey, Stob, and Soare about whether halves of Friedberg splittings must lie in the same orbit.


Sign in / Sign up

Export Citation Format

Share Document