Recursive and r.e. quotient Boolean algebras

Archive for Mathematical Logic 33 (2):121-129 (1994)
  Copy   BIBTEX

Abstract

We prove a converse to one of the theorems from [F], giving a description in terms of Turing complexity of sets which can be coded into recursive and r.e. quotient Boolean algebras

Categories

Keywords

Reprint years

DOI

10.1007/bf01352933

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,894

External links

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

Through your library

My notes

Similar books and articles

Stability among r.e. quotient algebras.John Love - 1993 - Annals of Pure and Applied Logic 59 (1):55-63.
Congruences on a Balanced Pseudocomplemented Ockham Algebra whose Quotient Algebras are Boolean.Jie Fang & Lei-Bo Wang - 2010 - Studia Logica 96 (3):421-431.
Recursive properties of relations on models.Geoffrey R. Hird - 1993 - Annals of Pure and Applied Logic 63 (3):241-269.
Weakly semirecursive sets.Carl G. Jockusch & James C. Owings - 1990 - Journal of Symbolic Logic 55 (2):637-644.
Boolean algebras and orbits of the lattice of R.e. Sets modulo the finite sets.Peter Cholak - 1990 - Journal of Symbolic Logic 55 (2):744-760.
Borel complexity of isomorphism between quotient Boolean algebras.Su Gao & Michael Ray Oliver - 2008 - Journal of Symbolic Logic 73 (4):1328-1340.
Recursive unary algebras and trees.Bakhadyr Khoussainov - 1994 - Annals of Pure and Applied Logic 67 (1-3):213-268.
Decidable Boolean algebras of low level.S. S. Goncharov - 1998 - Annals of Pure and Applied Logic 94 (1-3):75-95.
A remark on Martin's conjecture.Su Gao - 2001 - Journal of Symbolic Logic 66 (1):401-406.
On Boolean Algebras and their Recursive Completions.E. W. Madison - 1985 - Mathematical Logic Quarterly 31 (31-34):481-486.

Analytics

Added to PP
2013-11-23

Downloads
54 (#447,901)

6 months
7 (#633,568)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable Boolean algebras.Julia Knight & Michael Stob - 2000 - Journal of Symbolic Logic 65 (4):1605-1623.
Index sets for Π01 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1):3-61.

Add more citations

References found in this work

Hiearchies of Boolean algebras.Lawrence Feiner - 1970 - Journal of Symbolic Logic 35 (3):365-374.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.

Add more references