Vladimir Rybakov

Dr. Vladimir Rybakov


Research Focus & Metrics

Academic Career Length

53Years (1974-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 1984 in Algebra and Logic
Verified
Journal Article
Closed access
PDF file
VRVladimir Rybakov
Vladimir Rybakov

1 March 1974 in Algebra and Logic
Verified
Journal Article
Closed access
PDF file
LML. L. Maksimova
L. L. Maksimova
VRVladimir Rybakov
Vladimir Rybakov

1 December 2005 in The Journal of Symbolic Logic
Verified
Journal Article
Closed access
PDF file
VRVladimir Rybakov
Vladimir Rybakov
We investigate logical consequence in temporal logics in terms of logical consecutions, i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be ‘correct’ in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logicLDTL, consisting of all formulas valid in the frame 〈L≤, ≥〉 of all integer numbers, is the prime object of our investigation. We describe consecutions admissible inLDTLin a semantic way—via consecutions valid in special temporal Kripke/Hintikka models. Then we state that any temporal inference rule has a reduced normal form which is given in terms of uniform formulas of temporal degree 1. Using these facts and enhanced semantic techniques we construct an algorithm, which recognizes consecutions admissible inLDTL. Also, we note that using the same technique it follows that the linear temporal logicL(N) of all natural numbers is also decidable w.r.t. inference rules. So, we prove that both logicsLDTLandL(N) are decidable w.r.t. admissible consecutions. In particular, as a consequence, they both are decidable (known fact), and the given deciding algorithms are explicit.

18 July 2010 in Journal of Logic and Computation
Verified
Journal Article
Open access
PDF file
SBSergey Babenyshev
Sergey Babenyshev
VRVladimir Rybakov
Vladimir Rybakov
The object of our study is the propositional linear temporal logic LTL with operations Until and Next.We deal with inference rules admissible in LTL. Earlier the decidability of LTLw.r.t. to admissibility was shown. That, in particular, allowed to suggest a recursive infinite basis for admissible rules. However, that result gives no information about the structure and properties of such basis, thereby not allowing to use it for inferences. The current article aims to cover this gap and to provide an explicit (infinite) basis for rules admissible in LTL.

1 November 2001 in Mathematical Logic Quarterly
Verified
Journal Article
Closed access
PDF file
VRVladimir Rybakov
Vladimir Rybakov

1 August 2008 in Annals of Pure and Applied Logic
Verified
Journal Article
Closed access
VRVladimir Rybakov
Vladimir Rybakov