论文信息 - NOTES ON THE JUMP OF A STRUCTURES - 字舞流文

NOTES ON THE JUMP OF A STRUCTURES

We introduce the notions of a complete set of computably innitary 0 relations on a structure, of the jump of a structure, and of admitting nth jump inversion.

Antonio Montalb An | A. An

[1] Julia F. Knight,et al. Enumerations in computable structure theory , 2005, Ann. Pure Appl. Log..

[2] Julia F. Knight,et al. Generic Copies of Countable Structures , 1989, Ann. Pure Appl. Log..

[3] J. Thurber. Every Low 2 Boolean Algebra has a Recursive Copy , 1995 .

[4] John Chisholm,et al. Effective model theory vs. recursive model theory , 1990, Journal of Symbolic Logic.

[5] Joseph S. Miller,et al. LINEAR ORDERS WITH FINITELY MANY DESCENDING CUTS , 2008 .

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

[7] Julia A. Knight,et al. Computable structures and the hyperarithmetical hierarchy , 2000 .

[8] Michael Stob,et al. Computable Boolean algebras , 2000, Journal of Symbolic Logic.

[9] Carl G. Jockusch,et al. Every low Boolean algebra is isomorphic to a recursive one , 1994 .

[10] Rodney G. Downey,et al. Orderings with th jump degree 0 , 1992 .