Weakly Precomplete Equivalence Relations in the Ershov Hierarchy › Research Explorer

Novosibirsk State University's Research Portal

Weakly Precomplete Equivalence Relations in the Ershov Hierarchy

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

Section of Discrete Mathematics and Computer Science of MMD and SESC

DOI

https://doi.org/10.1007/s10469-019-09538-y
Final published version

N. A. Bazhenov
B. S. Kalmurzaev

Original language	English
Pages (from-to)	199-213
Number of pages	15
Journal	Algebra and Logic
Volume	58
Issue number	3
DOIs	https://doi.org/10.1007/s10469-019-09538-y
Publication status	Published - 1 Jul 2019

Research areas

computable reducibility, equivalence relation, Ershov hierarchy, universal equivalence relation, weakly precomplete equivalence relation

OECD FOS+WOS

ID: 22361348