Results 1  10
of
23
Degree spectra and computable dimension in algebraic structures
 Annals of Pure and Applied Logic 115 (2002
, 2002
"... \Lambda \Lambda ..."
(Show Context)
Computable categoricity of trees of finite height
 Journal of Symbolic Logic
"... We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ0 3conditi ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
(Show Context)
We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ0 3condition. We show that all trees which are not computably categorical have computable dimension ω. Finally, we prove that for every n ≥ 1 in ω, there exists a computable tree of finite height which is ∆0 n+1categorical but not ∆0 ncategorical.
Degree spectra of prime models
 J. Symbolic Logic
, 2004
"... 2.1 Notation from model theory................... 4 2.2 F ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(Show Context)
2.1 Notation from model theory................... 4 2.2 F
Computable trees, prime models, and relative decidability
 PROC. AMER. MATH. SOC
, 2005
"... We show that for every computable tree T with no dead ends and all paths computable, and every D>T ∅, there is a Dcomputable listing of the isolated paths of T. It follows that for every complete decidable theory T such that all the types of T are computable and every D>T ∅, there is a Ddec ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
We show that for every computable tree T with no dead ends and all paths computable, and every D>T ∅, there is a Dcomputable listing of the isolated paths of T. It follows that for every complete decidable theory T such that all the types of T are computable and every D>T ∅, there is a Ddecidable prime model of T. This result extends a theorem of Csima and yields a stronger version of the theorem, due independently to Slaman and Wehner, that there is a structure with presentations of every nonzero degree but no computable presentation.
Enumerations in computable structure theory
 Ann. Pure Appl. Logic
"... Goncharov, Harizanov, Knight, Miller, and Solomon gratefully acknowledge NSF support under binational ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Goncharov, Harizanov, Knight, Miller, and Solomon gratefully acknowledge NSF support under binational
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
Degree spectra and cospectra of structures
 Ann. Sofia Univ., Fac. Math. and Inf
, 2003
"... Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all enumeration degrees generated by the presentations of A on the natural numbers. The cospectrum of A is the set of all lower bounds of DS(A). We prove some general properties of the degree spectra ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. Given a countable structure A, we dene the degree spectrum DS(A) of A to be the set of all enumeration degrees generated by the presentations of A on the natural numbers. The cospectrum of A is the set of all lower bounds of DS(A). We prove some general properties of the degree spectra which show that they behave with respect to their cospectra very much like the cones of enumeration degrees. Among the results are the analogs of Selman's Theorem [14], the Minimal Pair Theorem and the existence of a quasiminimal enumeration degree. 1.
THE SLAMANWEHNER THEOREM IN HIGHER RECURSION THEORY
"... A central concern of computable model theory is the restriction that algebraic structure imposes on the information content of an object of study. One asks about a countable object, what information is coded intrinsically into this object, which cannot be avoided by passing to an isomorphic copy of ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
A central concern of computable model theory is the restriction that algebraic structure imposes on the information content of an object of study. One asks about a countable object, what information is coded intrinsically into this object, which cannot be avoided by passing to an isomorphic copy of the object? Given a
Computability, Definability and Algebraic Structures
, 1999
"... In a later section, we will look at a result of Coles, Downey and Slaman [16] of pure computability theory. The result is that, for any set X, the set ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In a later section, we will look at a result of Coles, Downey and Slaman [16] of pure computability theory. The result is that, for any set X, the set