Travelled to:1 × Czech Republic
1 × Poland
1 × Spain
1 × United Kingdom
4 × USA
Collaborated with:∅ A.Voronkov
Talks about:theori (3) system (3) rewrit (3) arithmet (2) complex (2) decid (2) bound (2) noetherian (1) elementari (1) nonrecurs (1)
Person: Sergei G. Vorobyov
DBLP: Vorobyov:Sergei_G=
Contributed to:
1998
1998
1997
1997
1996
199519891988Wrote 8 papers:
- CSL-1998-Vorobyov #functional #type system
- Subtyping Functional+Nonempty Record Types (SGV), pp. 283–297.
- PODS-1998-VorobyovV #complexity #logic programming #recursion #source code
- Complexity of Nonrecursive Logic Programs with Complex Values (SGV, AV), pp. 244–253.
- LICS-1997-Vorobyov #decidability
- The “Hardest” Natural Decidable Theory (SGV), pp. 294–305.
- RTA-1997-Vorobyov #decidability #first-order #linear
- The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable (SGV), pp. 254–268.
- CADE-1996-Vorobyov #bound
- An Improved Lower Bound for the Elementary Theories of Trees (SGV), pp. 275–287.
- POPL-1995-Vorobyov #bound #decidability #quantifier
- Structural Decidable Extensions of Bounded Quantification (SGV), pp. 164–175.
- RTA-1989-Vorobyov #induction
- Conditional Rewrite Rule Systems with Built-In Arithmetic and Induction (SGV), pp. 492–512.
- LICS-1988-Vorobyov #on the #term rewriting
- On the Arithmetic Inexpressiveness of Term Rewriting Systems (SGV), pp. 212–217.