论文信息 - Notes on the Jump of a Structure

Notes on the Jump of a Structure

We introduce the notions of a complete set of computably infinitary $\Pi^0_n$ relations on a structure, of the jump of a structure , and of admitting n th jump inversion .

Antonio Montalbán | A. Montalbán

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

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

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

[4] Julia F. Knight,et al. Intrinsic bounds on complexity and definability at limit levels , 2009, J. Symb. Log..

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

[6] Rodney G. Downey,et al. Orderings with αth jump degree 0(α) , 1992 .

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

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

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

[10] I︠U︡riĭ Leonidovich Ershov. Recursive model theory , 1998 .

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