Counting the number of equivalence classes of Borel and coanalytic equivalence relations

Annals of Mathematical Logic 18 (1):1 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Superrigidity and countable Borel equivalence relations.Simon Thomas - 2003 - Annals of Pure and Applied Logic 120 (1-3):237-262.
Popa superrigidity and countable Borel equivalence relations.Simon Thomas - 2009 - Annals of Pure and Applied Logic 158 (3):175-189.
Countable borel equivalence relations.S. Jackson, A. S. Kechris & A. Louveau - 2002 - Journal of Mathematical Logic 2 (01):1-80.
Treeable equivalence relations.Greg Hjorth - 2012 - Journal of Mathematical Logic 12 (1):1250003-.
Uniformity, universality, and computability theory.Andrew S. Marks - 2017 - Journal of Mathematical Logic 17 (1):1750003.
Continuous versus Borel reductions.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):761-770.

Analytics

Added to PP
2014-01-17

Downloads
24 (#1,007,070)

6 months
3 (#1,168,074)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
The problem of predicativity.Joseph R. Shoenfield - 1961 - In Bar-Hillel, Yehoshua & [From Old Catalog], Essays on the Foundations of Mathematics. Jerusalem,: Magnes Press. pp. 132--139.
Higher set theory and mathematical practice.Harvey M. Friedman - 1971 - Annals of Mathematical Logic 2 (3):325.
Omitting Classes of Elements.Michael Morley - 1968 - Journal of Symbolic Logic 33 (2):286-287.

Add more references