Victor Selivanov

From MaRDI portal
(Redirected from Person:949620)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Ordered fields and Grzegorczyk's hierarchy2026-02-27Paper
Marat Mirzaevich Arslanov (on his eightieth birthday)
Russian Mathematical Surveys
2024-11-15Paper
Logic vs topology on regular \(\omega \)-languages
Lecture Notes in Computer Science
2024-01-12Paper
Extending Wagner's hierarchy to deterministic visibly pushdown automata
Lecture Notes in Computer Science
2024-01-12Paper
scientific article; zbMATH DE number 7770056 (Why is no real title available?)2023-11-23Paper
scientific article; zbMATH DE number 7770056 (Why is no real title available?)
(available as arXiv preprint)
2023-11-23Paper
Primitive recursive ordered fields and some applications
Computability
2023-03-09Paper
Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
Theoretical Computer Science
2023-02-01Paper
Ideal presentations and numberings of some classes of effective quasi-Polish spaces2023-01-20Paper
Non-collapse of the effective Wadge hierarchy
Computability
2023-01-12Paper
Degrees of non-computability of homeomorphism types of Polish spaces2022-12-16Paper
Enumerating classes of effective quasi-Polish spaces2022-12-07Paper
Boole vs Wadge: comparing two basic tools of descriptive set theory2022-12-07Paper
Complexity issues for the iterated \(h\)-preorders2022-11-09Paper
Fine hierarchy of regular \(\omega\)-languages
TAPSOFT '95: Theory and Practice of Software Development
2022-08-18Paper
Wadge-like degrees of Borel bqo-valued functions
Proceedings of the American Mathematical Society
2022-07-08Paper
A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES
Journal of Symbolic Logic
2022-06-15Paper
Fields of algebraic numbers computable in polynomial time. II
Algebra and Logic
2022-06-15Paper
Primitive recursive ordered fields and some applications
(available as arXiv preprint)
2022-03-24Paper
Searching for applicable versions of computable structures2022-03-22Paper
Non-collapse of the effective wadge hierarchy
(available as arXiv preprint)
2022-03-22Paper
Input-driven pushdown automata on well-nested infinite strings2022-03-21Paper
Classifying \(\omega\)-regular aperiodic \(k\)-partitions2021-07-14Paper
Precomplete numberings
Journal of Mathematical Sciences (New York)
2021-06-29Paper
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
Computability
2021-06-25Paper
Non-Collapse of the Effective Wadge Hierarchy
(available as arXiv preprint)
2021-05-07Paper
Effective wadge hierarchy in computable quasi-Polish spaces
Sibirskie Elektronnye Matematicheskie Izvestiya
2021-04-15Paper
Q-Wadge degrees as free structures
Computability
2020-11-09Paper
On degree spectra of topological spaces
Lobachevskii Journal of Mathematics
2020-10-27Paper
Fields of algebraic numbers computable in polynomial time. I
Algebra and Logic
2020-08-03Paper
Well-Quasi Orders and Hierarchy Theory
Trends in Logic
2020-07-08Paper
Turing reducibility in the fine hierarchy
Annals of Pure and Applied Logic
2020-06-02Paper
On classes of regular languages related to monotone WQOs2020-05-12Paper
Computability on quasi-Polish spaces
(available as arXiv preprint)
2020-05-12Paper
A Q-Wadge Hierarchy in Quasi-Polish Spaces
(available as arXiv preprint)
2019-11-07Paper
Turing degrees in refinements of the arithmetical hierarchy
Algebra and Logic
2019-01-15Paper
Polynomial computability of fields of algebraic numbers
Doklady Mathematics
2018-11-01Paper
Extending Cooper's theorem to \(\Delta_3^0\) Turing degrees
Computability
2018-09-20Paper
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
(available as arXiv preprint)
2018-09-06Paper
Polynomial-time presentations of algebraic number fields2018-09-06Paper
Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs with Guaranteed Precision
(available as arXiv preprint)
2018-07-01Paper
On constructive number fields and computability of solutions of PDEs
Doklady Mathematics
2018-03-28Paper
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
(available as arXiv preprint)
2017-12-11Paper
Towards a descriptive theory of cb\(_{0}\)-spaces
Mathematical Structures in Computer Science
2017-11-22Paper
First order theories of some lattices of open sets
(available as arXiv preprint)
2017-10-12Paper
Extending Wadge theory to \(k\)-partitions2017-08-04Paper
Efficient algorithms for membership in Boolean hierarchies of regular languages
Theoretical Computer Science
2016-08-31Paper
The Boolean algebra of piecewise testable languages
Pursuit of the Universal
2016-08-17Paper
On the lattices of effectively open sets
Pursuit of the Universal
2016-08-17Paper
Some hierarchies of \(\mathsf{QCB}_0\)-spaces
Mathematical Structures in Computer Science
2016-07-27Paper
Wadge-like reducibilities on arbitrary quasi-Polish spaces
Mathematical Structures in Computer Science
2016-07-27Paper
Base-complexity classifications of \(\mathrm{qcb}_0\)-spaces
Computability
2016-04-13Paper
Base-complexity classifications of \(\mathrm{qcb}_0\)-spaces
Evolving Computability
2015-10-20Paper
Towards the Effective Descriptive Set Theory
Evolving Computability
2015-10-20Paper
Hyperprojective hierarchy of qcb0-spaces
Computability
2015-07-01Paper
Boolean algebras of regular languages
Algebra and Logic
2015-05-08Paper
Complexity issues for preorders on finite labeled forests2015-04-09Paper
Hyperprojective hierarchy of \(\mathrm{qcb}_{0}\)-spaces
Language, Life, Limits
2015-02-25Paper
Total representations
Logical Methods in Computer Science
2013-06-20Paper
On the difference hierarchy in countably based \(T_{0}\)-spaces
Electronic Notes in Theoretical Computer Science
2013-05-03Paper
Computing Solutions of Symmetric Hyperbolic Systems of PDE's
Electronic Notes in Theoretical Computer Science
2013-05-03Paper
On the Wadge reducibility of \(k\)-partitions
Electronic Notes in Theoretical Computer Science
2013-05-03Paper
Efficient algorithms for membership in Boolean hierarchies of regular languages2013-03-19Paper
Boolean Algebras of Regular ω-Languages
Language and Automata Theory and Applications
2013-03-18Paper
Fine hierarchies via Priestley duality
Annals of Pure and Applied Logic
2012-06-01Paper
Complexity issues for preorders on finite labeled forests
Models of Computation in Context
2011-09-09Paper
A Fine Hierarchy of ω-Regular k-Partitions
Models of Computation in Context
2011-09-09Paper
Boolean Algebras of Regular Languages
Developments in Language Theory
2011-07-29Paper
The shrinking property for NP and coNP
Theoretical Computer Science
2011-02-21Paper
Definability of closure operations in the \(h\)-quasiorder of labeled forests
Algebra and Logic
2011-01-24Paper
Definability in the structure of words with the inclusion relation
Siberian Mathematical Journal
2010-11-15Paper
Undecidability in Weihrauch degrees
Programs, Proofs, Processes
2010-07-29Paper
Definability in the Subword Order
Programs, Proofs, Processes
2010-07-29Paper
A Gandy theorem for abstract structures and applications to first-order definability
Mathematical Theory and Computational Practice
2010-07-28Paper
On the Wadge reducibility of \(k\)-partitions
The Journal of Logic and Algebraic Programming
2009-12-18Paper
Computing the solution operators of symmetric hyperbolic systems of PDE2009-10-28Paper
Definability in the Infix Order on Words
Developments in Language Theory
2009-07-07Paper
Definability in the \(h\)-quasiorder of labeled forests
Annals of Pure and Applied Logic
2009-06-11Paper
Undecidability in Some Structures Related to Computation Theory
Journal Of Logic And Computation
2009-03-02Paper
Wadge reducibility and infinite computations
Mathematics in Computer Science
2009-02-17Paper
Hierarchies and reducibilities on regular languages related to modulo counting
RAIRO - Theoretical Informatics and Applications
2008-12-22Paper
Hierarchies and reducibilities on regular languages related to modulo counting
RAIRO - Theoretical Informatics and Applications
2008-12-22Paper
The quotient algebra of labeled forests modulo h-equivalence
Algebra and Logic
2008-12-18Paper
FINE HIERARCHY OF REGULAR APERIODIC ω-LANGUAGES
International Journal of Foundations of Computer Science
2008-11-24Paper
Complexity of Topological Properties of Regular ω-Languages
Developments in Language Theory
2008-10-30Paper
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
2008-10-21Paper
The Shrinking Property for NP and coNP
Logic and Theory of Algorithms
2008-06-19Paper
Complexity of Aperiodicity for Topological Properties of Regular ω-Languages
Logic and Theory of Algorithms
2008-06-19Paper
Complexity of topological properties of regular \(\omega\)-languages2008-06-11Paper
Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
Journal Of Logic And Computation
2008-02-07Paper
Fine Hierarchy of Regular Aperiodic ω-Languages
Developments in Language Theory
2007-11-28Paper
Definability in the Homomorphic Quasiorder of Finite Labeled Forests
Lecture Notes in Computer Science
2007-11-13Paper
A Useful Undecidable Theory
Lecture Notes in Computer Science
2007-11-13Paper
Hierarchies of Δ02‐measurable k ‐partitions
Mathematical Logic Quarterly
2007-09-17Paper
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science
2007-04-30Paper
Towards a descriptive set theory for domain-like structures
Theoretical Computer Science
2006-12-07Paper
Classifying countable Boolean terms
Algebra and Logic
2006-10-24Paper
Variations of Wadge reducibility2006-07-18Paper
New Computational Paradigms
Lecture Notes in Computer Science
2006-01-11Paper
A reducibility for the dot-depth hierarchy
Theoretical Computer Science
2005-12-06Paper
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science
2005-08-22Paper
scientific article; zbMATH DE number 2154085 (Why is no real title available?)2005-04-08Paper
scientific article; zbMATH DE number 2154088 (Why is no real title available?)2005-04-08Paper
Hierarchies in?-spaces and applications
MLQ
2005-02-16Paper
Wadge Degrees ofω-Languages of Deterministic Turing Machines
RAIRO - Theoretical Informatics and Applications
2004-05-18Paper
Wadge Degrees ofω-Languages of Deterministic Turing Machines
RAIRO - Theoretical Informatics and Applications
2004-05-18Paper
scientific article; zbMATH DE number 1962805 (Why is no real title available?)2003-08-11Paper
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
RAIRO - Theoretical Informatics and Applications
2003-07-15Paper
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
RAIRO - Theoretical Informatics and Applications
2003-07-15Paper
Relating Automata-theoretic Hierarchies to Complexity-theoretic Hierarchies
RAIRO - Theoretical Informatics and Applications
2003-07-15Paper
scientific article; zbMATH DE number 1936756 (Why is no real title available?)2003-06-25Paper
scientific article; zbMATH DE number 1936756 (Why is no real title available?)2003-06-25Paper
scientific article; zbMATH DE number 1839454 (Why is no real title available?)2002-12-02Paper
scientific article; zbMATH DE number 1688391 (Why is no real title available?)2002-01-09Paper
scientific article; zbMATH DE number 1414285 (Why is no real title available?)2000-03-16Paper
scientific article; zbMATH DE number 1396725 (Why is no real title available?)2000-01-31Paper
Fine hierarchy of regular \(\omega\)-languages
Theoretical Computer Science
1998-08-13Paper
scientific article; zbMATH DE number 956483 (Why is no real title available?)1997-02-24Paper
On recursively enumerable structures
Annals of Pure and Applied Logic
1997-02-11Paper
Fine hierarchies and Boolean terms
Journal of Symbolic Logic
1995-10-31Paper
Recursiveness of ω‐Operations
Mathematical Logic Quarterly
1994-09-08Paper
Jumps of certain classes of \(\Delta_ 2^ 0\)-sets
Mathematical Notes
1993-12-06Paper
Refined hierarchy of formulas
Algebra and Logic
1993-06-29Paper
Fine hierarchy and definable index sets
Algebra and Logic
1993-06-29Paper
scientific article; zbMATH DE number 125241 (Why is no real title available?)1993-02-21Paper
scientific article; zbMATH DE number 58108 (Why is no real title available?)1992-09-27Paper
scientific article; zbMATH DE number 28544 (Why is no real title available?)1992-06-27Paper
scientific article; zbMATH DE number 6318 (Why is no real title available?)1992-06-25Paper
Index sets of classes of hyper-hypersimple sets
Algebra and Logic
1992-06-25Paper
scientific article; zbMATH DE number 4125388 (Why is no real title available?)1989-01-01Paper
Arithmetic hierarchy and ideals of enumerated Boolean algebras
Siberian Mathematical Journal
1989-01-01Paper
Application of precomplete enumerations to tabular-type degrees and index sets
Algebra and Logic
1989-01-01Paper
Ershov hierarchy and the T-jump
Algebra and Logic
1988-01-01Paper
scientific article; zbMATH DE number 4085634 (Why is no real title available?)1988-01-01Paper
Algorithmic complexity of algebraic systems
Mathematical Notes
1988-01-01Paper
Index sets of quotient objects of the Post numeration
Algebra and Logic
1988-01-01Paper
scientific article; zbMATH DE number 4055599 (Why is no real title available?)1987-01-01Paper
Automorphism groups of numbered sets
Mathematical Notes
1987-01-01Paper
Ershov hierarchy
Siberian Mathematical Journal
1985-01-01Paper
Index sets in the hyperarithmetical hierarchy
Siberian Mathematical Journal
1984-01-01Paper
Hierarchy of limiting computations
Siberian Mathematical Journal
1984-01-01Paper
Hierarchies of hyperarithmetical sets and functions
Algebra and Logic
1983-01-01Paper
Structure of degrees of generalized index sets
Algebra and Logic
1983-01-01Paper
scientific article; zbMATH DE number 3966054 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3851066 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3863189 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3825780 (Why is no real title available?)1982-01-01Paper
Structures of the degrees of unsolvability of index sets
Algebra and Logic
1980-01-01Paper
scientific article; zbMATH DE number 3685469 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3637843 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3639605 (Why is no real title available?)1978-01-01Paper
Some remarks about classes of recursively enumerable sets
Siberian Mathematical Journal
1978-01-01Paper
scientific article; zbMATH DE number 3601574 (Why is no real title available?)1978-01-01Paper
Enumerations of canonically calculable families of finite sets
Siberian Mathematical Journal
1978-01-01Paper
scientific article; zbMATH DE number 3596815 (Why is no real title available?)1977-01-01Paper
Enumerations of families of general recursive functions
Algebra and Logic
1977-01-01Paper
Two theorems on computable numberings
Algebra and Logic
1977-01-01Paper
scientific article; zbMATH DE number 3618124 (Why is no real title available?)1976-01-01Paper
scientific article; zbMATH DE number 3557772 (Why is no real title available?)1976-01-01Paper
scientific article; zbMATH DE number 3542420 (Why is no real title available?)1976-01-01Paper
Degree spectra of homeomorphism types of compact Polish spaces
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Victor Selivanov