183 results on '"Bazhenov, Nikolay"'
Search Results
2. On diagonal functions for equivalence relations
3. A Lopez-Escobar Theorem for Continuous Domains
4. On Arithmetical Numberings in Reverse Mathematics
5. On Learning Families of Ideals in Lattices and Boolean Algebras
6. Primitive recursive reverse mathematics
7. Relatively acceptable notation
8. Isomorphism Types of Rogers Semilattices in the Analytical Hierarchy
9. Computably and punctually universal spaces
10. Learning algebraic structures with the help of Borel equivalence relations
11. Intrinsic complexity of recursive functions on natural numbers with standard order
12. Punctual equivalence relations and their (punctual) complexity
13. Approximating approximate reasoning: Fuzzy sets and the Ershov hierarchy
14. Computable Stone spaces
15. On the Turing complexity of learning finite families of algebraic structures
16. Computable Heyting Algebras with Distinguished Atoms and Coatoms
17. Complexity of Σn0-classifications for definable subsets
18. Rogers semilattices in the analytical hierarchy: The case of finite families
19. On bi-embeddable categoricity of algebraic structures
20. Comparing the isomorphism types of equivalence structures and preorders
21. A Note on Computable Embeddings for Ordinals and Their Reverses
22. Isomorphism types of Rogers semilattices in the analytical hierarchy
23. Computable Stone spaces
24. Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies
25. Degrees of bi-embeddable categoricity
26. Learning families of algebraic structures from informant
27. Computable embeddings for pairs of linear orders
28. Learning algebraic structures with the help of Borel equivalence relations
29. On Two Types of Concept Lattices in the Theory of Numberings
30. Well-Orders Realized by C.E. Equivalence Relations
31. Calculating the Mind Change Complexity of Learning Algebraic Structures
32. Primitive recursive reverse mathematics
33. How to approximate fuzzy sets: mind-changes and the Ershov Hierarchy
34. Classifying equivalence relations in the Ershov hierarchy
35. Degrees of bi-embeddable categoricity of equivalence structures
36. A LOPEZ-ESCOBAR THEOREM FOR CONTINUOUS DOMAINS
37. Semilattices of Punctual Numberings
38. Definable Subsets of Polynomial-Time Algebraic Structures
39. AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
40. Well-Orders Realized by C.E. Equivalence Relations
41. Calculating the Mind Change Complexity of Learning Algebraic Structures
42. Learning families of algebraic structures from informant
43. Every \Delta^0_2 Polish space is computable topological.
44. Bounded Reducibility for Computable Numberings
45. Effective Embeddings for Pairs of Structures
46. Computable Isomorphisms of Distributive Lattices
47. Computably enumerable equivalence relations via primitive recursive reductions
48. Every Δ⁰₂ Polish space is computable topological
49. Primitive recursive reverse mathematics
50. Preface
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.