Results 1  10
of
18
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
Boolean algebras, Stone spaces, and the iterated Turing jump
 Journal of Symbolic Logic
, 1994
"... We show, roughly speaking, that it requires ! iterations of the Turing jump to decode nontrivial information from Boolean algebras in an isomorphism invariant fashion. More precisely, if ff is a recursive ordinal, A is a countable structure with finite signature, and d is a degree, we say that A has ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We show, roughly speaking, that it requires ! iterations of the Turing jump to decode nontrivial information from Boolean algebras in an isomorphism invariant fashion. More precisely, if ff is a recursive ordinal, A is a countable structure with finite signature, and d is a degree, we say that A has ff th jump degree d if d is the least degree which is the ffth jump of some degree c such there is an isomorphic copy of A with universe ! in which the functions and relations have degree at most c. We show that every degree d 0 (!) is the ! th  jump degree of a Boolean algebra, but that, for n ! !, no Boolean algebra has n th jump degree d ? 0 (n) . The former result follows easily from work of L. Feiner. The proof of the latter result uses the forcing methods of J. Knight, together with an analysis of various equivalences between Boolean algebras based on a study of their Stone spaces. A byproduct of the proof is a method for constructing Stone spaces with various prescribe...
Effective presentability of Boolean algebras of CantorBendixson rank 1
 Journal of Symbolic Logic
, 1999
"... We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B/I is of CantorBendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though F ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B/I is of CantorBendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of infinite CantorBendixson rank.
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 6 (1 self)
 Add to MetaCart
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.
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
On the nbackandforth types of Boolean algebras
 In preparation
"... Abstract. The objective of this paper is to uncover the structure of the backandforth equivalence classes at the finite levels for the class of Boolean algebras. As an application, we obtain bounds on the computational complexity of determining the backandforth equivalence classes of a Boolean al ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. The objective of this paper is to uncover the structure of the backandforth equivalence classes at the finite levels for the class of Boolean algebras. As an application, we obtain bounds on the computational complexity of determining the backandforth equivalence classes of a Boolean algebra for finite levels. This result has implications for characterizing the relatively intrinsically Σ 0 n relations of Boolean algebras as existential formulas over a finite set of relations. 1.
ON STRONGLY JUMP TRACEABLE REALS
"... Abstract. In this paper we show that there is no minimal bound for jump traceability. In particular, there is no single order function such that strong jump traceability is equivalent to jump traceability for that order. The uniformity of the proof method allows us to adapt the technique to showing ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In this paper we show that there is no minimal bound for jump traceability. In particular, there is no single order function such that strong jump traceability is equivalent to jump traceability for that order. The uniformity of the proof method allows us to adapt the technique to showing that the index set of the c.e. strongly jump traceables is Π 0 4complete. §1. Introduction. One of the fundamental concerns of computability theory is in understanding the relative difficulty of computational problems as measured by Turing reducubility (≤T). The equivalence classes of the preordering ≤T are called Turing degrees, and it is long recognized that the fundamental operator on the structure of the Turing degrees is the jump operator. For a set A, the
BOOLEAN ALGEBRA APPROXIMATIONS
"... Abstract. Knight and Stob proved that every low4 Boolean algebra is 0 (6)isomorphic to a computable one. Furthermore, for n = 1, 2, 3, 4, every lown Boolean algebra is 0 (n+2)isomorphic to a computable one. We show that this is not true for n = 5: there is a low5 Boolean algebra that is not 0 (7) ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Knight and Stob proved that every low4 Boolean algebra is 0 (6)isomorphic to a computable one. Furthermore, for n = 1, 2, 3, 4, every lown Boolean algebra is 0 (n+2)isomorphic to a computable one. We show that this is not true for n = 5: there is a low5 Boolean algebra that is not 0 (7)isomorphic to any computable Boolean algebra. It is worth remarking that, because of the machinery developed, the proof uses at most a 0 ′ ′priority argument. The technique used to construct this Boolean algebra is new and might be useful in other applications, such as to solve the lown Boolean algebra problem either positively or negatively. 1.
Computability of Fraïssé limits
 IN PREPARATION
"... Fraïssé studied countable structures S through analysis of the age of S, i.e., the set of all finitely generated substructures of S. We investigate the effectiveness of his analysis, considering effectively presented lists of finitely generated structures and asking when such a list is the age of a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Fraïssé studied countable structures S through analysis of the age of S, i.e., the set of all finitely generated substructures of S. We investigate the effectiveness of his analysis, considering effectively presented lists of finitely generated structures and asking when such a list is the age of a computable structure. We focus particularly on the Fraïssé limit. We also show that degree spectra of relations on a sufficiently nice Fraïssé limit are always upward closed unless the relation is definable by a quantifierfree formula. We give some sufficient or necessary conditions for a Fraïssé limit to be spectrally universal. As an application, we prove that the computable atomless Boolean algebra is spectrally universal.
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