On the main scientific achievements of Victor Selivanov
From MaRDI portal
Publication:6146819
DOI10.3233/com-230951MaRDI QIDQ6146819
Takayuki Kihara, Nikolay Bazhenov, Svetlana V. Selivanova, Dieter Spreen
Publication date: 31 January 2024
Published in: Computability (Search for Journal in Brave)
computability theoryhierarchiesdescriptive set theorydegreescomplexity theorydomain theorynumbering theorycomputable analysisasymmetric topologyquasi-Polish spaceswadge degreestheory of formal languages
Cites Work
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Hyperprojective hierarchy of qcb0-spaces
- Mathematical Foundations of Computer Science 2004
- First Order Theories of Some Lattices of Open Sets
- On the structure of the Wadge degrees of bqo-valued Borel functions
- Classifying countable Boolean terms
- Definability in the Homomorphic Quasiorder of Finite Labeled Forests
- A Useful Undecidable Theory
- Fine Hierarchy of Regular Aperiodic ω-Languages
- Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
- New Computational Paradigms
- Preface to the special issue: Computing with infinite data: topological and logical foundations
- Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization
- Wadge-like reducibilities on arbitrary quasi-Polish spaces
- Some hierarchies of QCB0-spaces
- COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM
- Primitive recursive ordered fields and some applications
- Logical Approaches to Computational Barriers
- Numberings, c.e. oracles, and fixed points
- Computable Stone spaces
- COMPUTABLY COMPACT METRIC SPACES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms for membership in Boolean hierarchies of regular languages
- A Wadge hierarchy for second countable spaces
- Algebraic structures computable without delay
- Application of precomplete enumerations to tabular-type degrees and index sets
- Definability in the structure of words with the inclusion relation
- Definability of closure operations in the \(h\)-quasiorder of labeled forests
- The shrinking property for NP and coNP
- New degree spectra of Polish spaces
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Fine hierarchies and m-reducibilities in theoretical computer science
- Definability in the \(h\)-quasiorder of labeled forests
- On the Wadge reducibility of \(k\)-partitions
- Structure of degrees of generalized index sets
- Hierarchy of limiting computations
- Automorphism groups of numbered sets
- Algorithmic complexity of algebraic systems
- Recursion on the countable functionals
- Reducibility by Zhegalkin-linear tables
- Structures of the degrees of unsolvability of index sets
- Some remarks about classes of recursively enumerable sets
- Polynomial-time presentations of algebraic number fields
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
- On constructive number fields and computability of solutions of PDEs
- Turing degrees in refinements of the arithmetical hierarchy
- Learning by the process of elimination
- Quasi-Polish spaces
- Polynomial computability of fields of algebraic numbers
- Extending Wadge theory to \(k\)-partitions
- Fixed-point selection functions
- Computable topological abelian groups
- Boole vs Wadge: comparing two basic tools of descriptive set theory
- Computational complexity of classical solutions of partial differential equations
- Degrees of non-computability of homeomorphism types of Polish spaces
- Input-driven pushdown automata on well-nested infinite strings
- Non-collapse of the effective wadge hierarchy
- Fields of algebraic numbers computable in polynomial time. II
- Turing reducibility in the fine hierarchy
- On degree spectra of topological spaces
- Fixed point theorems for precomplete numberings
- Enumerations in computable structure theory
- A reducibility for the dot-depth hierarchy
- Effective wadge hierarchy in computable quasi-Polish spaces
- Base-complexity classifications of qcb0-spaces1
- Complexity Issues for Preorders on Finite Labeled Forests
- A Fine Hierarchy of ω-Regular k-Partitions
- Hierarchies in?-spaces and applications
- The Boolean Algebra of Piecewise Testable Languages
- On the Lattices of Effectively Open Sets
- Towards the Effective Descriptive Set Theory
- The Shrinking Property for NP and coNP
- Complexity of Aperiodicity for Topological Properties of Regular ω-Languages
- Complexity of Topological Properties of Regular ω-Languages
- FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
- The quotient algebra of labeled forests modulo h-equivalence
- A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
- Definability in the Subword Order
- Undecidability in Weihrauch Degrees
- Undecidability in Some Structures Related to Computation Theory
- Borel-amenable reducibilities for sets of reals
- Definability in the Infix Order on Words
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Borel–Wadge degrees
- Wadge Degrees ofω-Languages of Deterministic Turing Machines
- Towards a descriptive theory of cb0-spaces
- Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
- The Rice-Shapiro theorem in Computable Topology
- Extending Cooper’s theorem to Δ 3 0 Turing degrees
- Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
- Fine hierarchies and Boolean terms
- Boolean Algebras of Regular ω-Languages
- Computing Solutions of Symmetric Hyperbolic Systems of PDE's
- On the Difference Hierarchy in Countably Based T0-Spaces
- On the Wadge Reducibility of k-Partitions
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- Wadge-like degrees of Borel bqo-valued functions
- Fine hierarchy of regular ω-languages
- ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
- Q-Wadge degrees as free structures
