Hiearchies of Boolean algebras

Journal of Symbolic Logic 35 (3):365-374 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
34 (#445,975)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Countable thin Π01 classes.Douglas Cenzer, Rodney Downey, Carl Jockusch & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 59 (2):79-139.
On the equimorphism types of linear orderings.Antonio Montalbán - 2007 - Bulletin of Symbolic Logic 13 (1):71-99.
Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.
Recursion theory and ordered groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.

View all 19 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Computability & Unsolvability.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
Boolean Algebras.Roman Sikorski - 1966 - Journal of Symbolic Logic 31 (2):251-253.

Add more references