On Δ 2 0 -categoricity of equivalence relations

Annals of Pure and Applied Logic 166 (9):851-880 (2015)
  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: 99,445

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

Laforte, G., see Downey, R.T. Arai, Z. Chatzidakis & A. Pillay - 1998 - Annals of Pure and Applied Logic 95 (1-3):287.
Punctual definability on structures.Iskander Kalimullin, Alexander Melnikov & Antonio Montalban - 2021 - Annals of Pure and Applied Logic 172 (8):102987.
Δ0-complexity of the relation y = Πi ⩽ nF.Alessandro Berarducci & Paola D'Aquino - 1995 - Annals of Pure and Applied Logic 75 (1-2):49-56.
Linearization of definable order relations.Vladimir Kanovei - 2000 - Annals of Pure and Applied Logic 102 (1-2):69-100.
Jumps of computably enumerable equivalence relations.Uri Andrews & Andrea Sorbi - 2018 - Annals of Pure and Applied Logic 169 (3):243-259.

Analytics

Added to PP
2015-08-28

Downloads
24 (#781,794)

6 months
1 (#1,925,301)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alexander Melnikov
National Research University Higher School of Economics