The jump operation for structure degrees

Archive for Mathematical Logic 45 (3):249-265 (2005)
  Copy   BIBTEX

Abstract

One of the main problems in effective model theory is to find an appropriate information complexity measure of the algebraic structures in the sense of computability. Unlike the commonly used degrees of structures, the structure degree measure is total. We introduce and study the jump operation for structure degrees. We prove that it has all natural jump properties (including jump inversion theorem, theorem of Ash), which show that our definition is relevant. We study the relation between the structure degree jump (in the sense of Soskov) and the jump degrees of a structure (in the sense of Jockusch) and give necessary and sufficient conditions for their existence in the terms of structure degrees. We show some properties, distinguishing the structure degrees from the enumeration degrees

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
A jump inversion theorem for the enumeration jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
Initial segments of the enumeration degrees.Hristo Ganchev & Andrea Sorbi - 2016 - Journal of Symbolic Logic 81 (1):316-325.
Limit lemmas and jump inversion in the enumeration degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.
Definability of the jump operator in the enumeration degrees.I. Sh Kalimullin - 2003 - Journal of Mathematical Logic 3 (02):257-267.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
On the Symmetric Enumeration Degrees.Charles M. Harris - 2007 - Notre Dame Journal of Formal Logic 48 (2):175-204.
Goodness in the enumeration and singleton degrees.Charles M. Harris - 2010 - Archive for Mathematical Logic 49 (6):673-691.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.

Analytics

Added to PP
2013-11-23

Downloads
19 (#790,554)

6 months
7 (#592,867)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Degrees coded in jumps of orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.
Degrees of structures.Linda Jean Richter - 1981 - Journal of Symbolic Logic 46 (4):723-731.

View all 12 references / Add more references