#### Filter Results:

- Full text PDF available (34)

#### Publication Year

1987

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- V. L. Selivanov
- 2001

The boolean hierarchy of partitions was introduced and studied by K. W agner and S. Kosub, mostly over the lattice of N P-sets. We consider this hierarchy for the case of lattices having the reduction property and show that in this case the hierarchy behaves much easier and admits a deeper investigation. We completely characterize the hierarchy o v er some… (More)

- Victor L. Selivanov
- J. Symb. Log.
- 1995

- Victor L. Selivanov
- Theor. Comput. Sci.
- 2006

This is a survey of results in descriptive set theory for domains and similar spaces, with the emphasis on the ω-algebraic domains. We try to demonstrate that the subject is interesting in its own right and is closely related to some areas of theoretical computer science. Since the subject is still in its beginning, we discuss in detail several open… (More)

- Victor L. Selivanov
- STACS
- 1994

- Luca Motto Ros, Philipp Schlicht, Victor L. Selivanov
- Mathematical Structures in Computer Science
- 2015

The structure of the Wadge degrees on zero-dimensional spaces is very simple (almost well-ordered), but for many other natural non-zero-dimensional spaces (including the space of reals) this structure is much more complicated. We consider weaker notions of reducibility, including the so-called ∆ 0 α-reductions, and try to find for various natural… (More)

- Oleg V. Kudinov, Victor L. Selivanov
- CiE
- 2006

We prove that the homomorphic quasiorder of finite k-labeled forests has a hereditary undecidable first-order theory for k ≥ 3, in contrast to the known decidability result for k = 2. We establish also hereditary undecidability (again for every k ≥ 3) of first-order theories of two other relevant structures: the homomorphic quasiorder of finite k-labeled… (More)

- Victor L. Selivanov
- STACS
- 2001

We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of Higman, and on the Rabin tree theorem. In this way, we get purely logical, short proofs for some known facts on decidability, which might be of methodological interest. Our… (More)

- Victor L. Selivanov
- Mathematics in Computer Science
- 2008

Introduction Investigation of the infinite behavior of computing devices is of great interest for computer science because many hardware and software concurrent systems (like processors or operating systems) may not terminate. The study of infinite computations is important for several branches of theoretical computer science, including verification and… (More)

- Victor L. Selivanov
- Electr. Notes Theor. Comput. Sci.
- 2008