Results 1  10
of
39
Degree spectra and computable dimension in algebraic structures
 Annals of Pure and Applied Logic 115 (2002
, 2002
"... \Lambda \Lambda ..."
Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
 Ann. Pure Appl. Logic
, 1998
"... this paper we are interested in those structures in which the basic computations can be performed by Turing machines. ..."
Abstract

Cited by 25 (12 self)
 Add to MetaCart
this paper we are interested in those structures in which the basic computations can be performed by Turing machines.
On Presentations of Algebraic Structures
 in Complexity, Logic and Recursion Theory
, 1995
"... This paper is an expanded version of an part of a series of invited lectures given by the author during May 1995 in Siena, Italy to the COLORET II conference. This work is partially supported by Victoria University IGC and the Marsden Fund for Basic Science under grant VIC509. This paper is dedicat ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
This paper is an expanded version of an part of a series of invited lectures given by the author during May 1995 in Siena, Italy to the COLORET II conference. This work is partially supported by Victoria University IGC and the Marsden Fund for Basic Science under grant VIC509. This paper is dedicated to the memory of my friend and teacher Chris Ash who contributed so much to effective structure theory and who left us far too young early in 1995
Degree spectra of prime models
 J. Symbolic Logic
, 2004
"... 2.1 Notation from model theory................... 4 2.2 F ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
2.1 Notation from model theory................... 4 2.2 F
Shlapentokh; Turing degrees of isomorphism types of algebraic objects
 Journal of the London Mathematical Society
"... ..."
Questions in Computable Algebra and Combinatorics
, 1999
"... this article, we will focus on two areas of computable mathematics, namely computable algebra and combinatorics. The goal of this article is to present a number of open questions in both computable algebra and computable combinatorics and to give the reader a sense of the research activity in these ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
this article, we will focus on two areas of computable mathematics, namely computable algebra and combinatorics. The goal of this article is to present a number of open questions in both computable algebra and computable combinatorics and to give the reader a sense of the research activity in these elds. Our philosophy is to try to highlight questions, whose solutions we feel will either give insight into algebra or combinatorics, or will require new technology in the computabilitytheoretical techniques needed. A good historical example of the rst phenomenom is the word problem for nitely presented groups which needed the development of a great deal of group theoretical machinery for its solution by Novikov [110] and Boone [10]. A good example of the latter phenomenon is the recent solution by Coles, Downey and Slaman [17] of the question of whether all rank one torsion free 1991 Mathematics Subject Classi cation. Primary 03D45; Secondary 03D25
Ordercomputable sets
"... We give a straightforward computablemodeltheoretic definition of a property of ∆0 2 sets, called ordercomputability. We then prove various results about these sets which suggest that, simple though the definition is, the property defies any characterization in pure computability theory. The most ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We give a straightforward computablemodeltheoretic definition of a property of ∆0 2 sets, called ordercomputability. We then prove various results about these sets which suggest that, simple though the definition is, the property defies any characterization in pure computability theory. The most striking example is the construction of two computably isomorphic c.e. sets, one of which is ordercomputable and the other not. 1
On the complexity of the successivity relation in computable linear orderings
"... In this paper, we solve a longstanding open question (see, e.g., Downey [6, §7] and Downey and Moses [11]), about the spectrum of the successivity relation on a computable linear ordering. We show that if a computable linear ordering L has infinitely many successivities, then the spectrum of the s ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper, we solve a longstanding open question (see, e.g., Downey [6, §7] and Downey and Moses [11]), about the spectrum of the successivity relation on a computable linear ordering. We show that if a computable linear ordering L has infinitely many successivities, then the spectrum of the successivity relation is closed upwards in the computably enumerable Turing degrees. To do this, we use a new method of constructing ∆ 0 3isomorphisms, which has already found other applications such as Downey, Kastermans and Lempp [9] and is of independent interest. It would seem to promise many further applications.
Soare, Bounding homogeneous models
"... A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a ddecidable homogeneous model A, i.e., the elementary diagram D e (A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithm ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a ddecidable homogeneous model A, i.e., the elementary diagram D e (A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithmetic) is homogeneous bounding. We prove that in fact a degree is homogeneous bounding if and only if it is a PA degree. We do this by showing that there is a single CD theory T such that every homogeneous model of T has a PA degree. 1
Constructive models of uncountably categorical theories
 PROC. AMER. MATH. SOC
, 1999
"... We construct a strongly minimal (and thus uncountably categorical) but not totally categorical theory in a finite language of binary predicates whose only constructive (or recursive) model is the prime model. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We construct a strongly minimal (and thus uncountably categorical) but not totally categorical theory in a finite language of binary predicates whose only constructive (or recursive) model is the prime model.