The following pages link to S. A. Badaev (Q810012):
Displayed 42 items.
- On weakly pre-complete positive equivalences (Q810013) (← links)
- A problem of S. S. Goncharov (Q1189063) (← links)
- On incomparable enumerations (Q1224090) (← links)
- Computable enumerations of families of general recursive functions (Q1254245) (← links)
- Positive enumerations (Q1259587) (← links)
- On cardinality of semilattices of enumerations of nondiscrete families (Q1335928) (← links)
- Some absolute properties of \(A\)-computable numberings (Q1731521) (← links)
- Minimal numerations of positively computable families (Q1892813) (← links)
- On minimal numerations (Q1914753) (← links)
- One-element Rogers semilattices in the Ershov hierarchy (Q2066095) (← links)
- Special classes of positive preorders (Q2145061) (← links)
- The structure of computably enumerable preorder relations (Q2213931) (← links)
- Families without minimal numberings (Q2342320) (← links)
- Generalized computable universal numberings (Q2342326) (← links)
- Inductive inference and computable numberings (Q2430009) (← links)
- Rogers semilattices with least and greatest elements in the Ershov hierarchy (Q2680581) (← links)
- Weakly precomplete computably enumerable equivalence relations (Q2793914) (← links)
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy (Q2910992) (← links)
- A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971) (← links)
- (Q3068278) (← links)
- (Q3360171) (← links)
- Elementary Theories for Rogers Semilattices (Q3409439) (← links)
- (Q3434481) (← links)
- On a Question of Frank Stephan (Q3502666) (← links)
- Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy (Q3546062) (← links)
- A decomposition of the Rogers semilattice of a family of d.c.e. sets (Q3630582) (← links)
- (Q4077999) (← links)
- (Q4133618) (← links)
- (Q4168603) (← links)
- (Q4220190) (← links)
- (Q4460829) (← links)
- (Q4501145) (← links)
- (Q4513962) (← links)
- (Q4530730) (← links)
- A note on partial numberings (Q4666942) (← links)
- (Q4795525) (← links)
- (Q4875117) (← links)
- ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q5107218) (← links)
- (Q5384966) (← links)
- Theory and Applications of Models of Computation (Q5898922) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5919177) (← links)
- On diagonal functions for equivalence relations (Q6128777) (← links)