Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies

N. A. Bazhenov; M. Mustafa; L. San Mauro; M. M. Yamaleev

doi:10.1134/S199508022002002X

Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies

N. A. Bazhenov, M. Mustafa, L. San Mauro, M. M. Yamaleev

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

Abstract: A standard tool for classifying the complexity of equivalence relations on ω is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which (Formula presented.), where α ≥ 2 is a computable ordinal and n is a non-zero natural number. We prove that there are infinitely many pairwise incomparable minimal equivalence relations that are properly in Γ.

Original language	English
Pages (from-to)	145-150
Number of pages	6
Journal	Lobachevskii Journal of Mathematics
Volume	41
Issue number	2
DOIs	https://doi.org/10.1134/S199508022002002X
Publication status	Published - Feb 1 2020

Funding

The work was supported by Nazarbayev University Faculty Development Competitive Research Grants N090118FD5342. Bazhenov was supported by the grant of the President of the Russian Federation (No. MK-1214.2019.1). San Mauro was supported by the Austrian Science Fund FWF, project M 2461. Yamaleev was supported by the Russian Science Foundation, project No. 18-11-00028. ACKNOWLEDGMENTS

Keywords

analytical hierarchy
computable reducibility
equivalence relation
hyperarithmetical hierarchy
minimal degree

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1134/S199508022002002X

Cite this

@article{ef7baf67a7134dd5aceb8b0457537cb4,

title = "Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies",

abstract = "Abstract: A standard tool for classifying the complexity of equivalence relations on ω is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which (Formula presented.), where α ≥ 2 is a computable ordinal and n is a non-zero natural number. We prove that there are infinitely many pairwise incomparable minimal equivalence relations that are properly in Γ.",

keywords = "analytical hierarchy, computable reducibility, equivalence relation, hyperarithmetical hierarchy, minimal degree",

author = "Bazhenov, \{N. A.\} and M. Mustafa and \{San Mauro\}, L. and Yamaleev, \{M. M.\}",

note = "Funding Information: The work was supported by Nazarbayev University Faculty Development Competitive Research Grants N090118FD5342. Bazhenov was supported by the grant of the President of the Russian Federation (No. MK-1214.2019.1). San Mauro was supported by the Austrian Science Fund FWF, project M 2461. Yamaleev was supported by the Russian Science Foundation, project No. 18-11-00028. ACKNOWLEDGMENTS Publisher Copyright: {\textcopyright} 2020, Pleiades Publishing, Ltd.",

year = "2020",

month = feb,

day = "1",

doi = "10.1134/S199508022002002X",

language = "English",

volume = "41",

pages = "145--150",

journal = "Lobachevskii Journal of Mathematics",

issn = "1995-0802",

publisher = "Pleiades Publishing",

number = "2",

}

TY - JOUR

T1 - Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies

AU - Bazhenov, N. A.

AU - Mustafa, M.

AU - San Mauro, L.

AU - Yamaleev, M. M.

N1 - Funding Information: The work was supported by Nazarbayev University Faculty Development Competitive Research Grants N090118FD5342. Bazhenov was supported by the grant of the President of the Russian Federation (No. MK-1214.2019.1). San Mauro was supported by the Austrian Science Fund FWF, project M 2461. Yamaleev was supported by the Russian Science Foundation, project No. 18-11-00028. ACKNOWLEDGMENTS Publisher Copyright: © 2020, Pleiades Publishing, Ltd.

PY - 2020/2/1

Y1 - 2020/2/1

N2 - Abstract: A standard tool for classifying the complexity of equivalence relations on ω is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which (Formula presented.), where α ≥ 2 is a computable ordinal and n is a non-zero natural number. We prove that there are infinitely many pairwise incomparable minimal equivalence relations that are properly in Γ.

AB - Abstract: A standard tool for classifying the complexity of equivalence relations on ω is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which (Formula presented.), where α ≥ 2 is a computable ordinal and n is a non-zero natural number. We prove that there are infinitely many pairwise incomparable minimal equivalence relations that are properly in Γ.

KW - analytical hierarchy

KW - computable reducibility

KW - equivalence relation

KW - hyperarithmetical hierarchy

KW - minimal degree

UR - http://www.scopus.com/inward/record.url?scp=85087878058&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85087878058&partnerID=8YFLogxK

U2 - 10.1134/S199508022002002X

DO - 10.1134/S199508022002002X

M3 - Article

AN - SCOPUS:85087878058

SN - 1995-0802

VL - 41

SP - 145

EP - 150

JO - Lobachevskii Journal of Mathematics

JF - Lobachevskii Journal of Mathematics

IS - 2

ER -

Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies

Abstract

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this