论文信息 - Recursive and r.e. quotient Boolean algebras

Recursive and r.e. quotient Boolean algebras

SummaryWe prove a converse to one of the theorems from [F], giving a description in terms of Turing complexity of sets which can be coded into recursive and r.e. quotient Boolean algebras.

John J. Thurber | J. Thurber

[1] Lawrence Feiner,et al. Hierarchies of Boolean algebras , 1970, Journal of Symbolic Logic.

[2] Christopher J. Ash,et al. Jumps of orderings , 1990 .

[3] Sabine Koppelberg,et al. Handbook of Boolean Algebras , 1989 .

[4] Christopher J. Ash. A Construction for Recursive Linear Orderings , 1991, J. Symb. Log..

[5] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .