Results 1 
4 of
4
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
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.
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
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