Applications of cut-free infinitary derivations to generalized recursion theory. Feasible graphs with standard universe. References and Citations. The dense simple sets are orbit complete with respect to the simple sets. Splitting theorems and the jump operator.
Lattice representations for computability theory.
Decidable Boolean algebras of low level. Definable properties of the computably enumerable sets. Coding a family of sets. A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees. Michael Rathjen , Edward R. Griffor , and Erik Palmgren .