On Dark Computably Enumerable Equivalence Relations

Bazhenov, Nikolay; Kalmurzaev, B. S.

doi:10.1134/s0037446618010032

Search citation statements

Order By: Relevance

Paper Sections

Select...

Issn 1991-346x1

Definition1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2023

Publication Types

Select...

Article6

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 7 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…is a linearly ordered set. The existence of a universal prelattice in the class of positive linear preorders was proved in [8].…”

Section: Issn 1991-346xmentioning

confidence: 99%

“…A positive preorder is called weakly precomplete [8], if for any total function , there exists an element such that . Note that the concept of weaklyprecompleteness for positive preorders is identical to this concept for positive equivalences, which was originally introduced in [9]and found to be very useful in the study of positive equivalences (see review [4]).…”

Section: Definitionmentioning

confidence: 99%

See 1 more Smart Citation