Vladimir Yu. Sazonov

20 papers A 1B 5Misc 1Journal 6Unranked 7
YearRankTypeTitle / Venue / Authors
2012 J jnl
The extensional ordering of the sequential functionals.
Ann. Pure Appl. Log.
Dag Normann, Vladimir Yu. Sazonov
2001 J jnl
D: Set-theoretic query language capturing LOGSPACE.
Ann. Math. Artif. Intell.
Alexander Leontjev, Vladimir Yu. Sazonov
2001 — conf
Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach.
Ershov Memorial Conference
Vladimir Yu. Sazonov
2000 — conf
Capturing LOGSPACE over Hereditarily-Finite Sets.
FoIKS
Alexander Leontjev, Vladimir Yu. Sazonov
1999 J jnl
Linear Ordering on Graphs, Anti-Founded Sets and Polynomial Time Computability.
Theor. Comput. Sci.
Alexei Lisitsa, Vladimir Yu. Sazonov
1997 — conf
Bounded Hyperset Theory and Web-like Data Bases.
Kurt Gödel Colloquium
Alexei Lisitsa, Vladimir Yu. Sazonov
1997 J jnl
Delta-Languages for Sets and LOGSPACE Computable Graph Transformers.
Theor. Comput. Sci.
Alexei Lisitsa, Vladimir Yu. Sazonov
1997 Misc conf
On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets.
LFCS
Alexei Lisitsa, Vladimir Yu. Sazonov
1995 A conf
Delta-Languages for Sets and sub-PTIME Graphs Transformers.
ICDT
Vladimir Yu. Sazonov, Alexei Lisitsa
1994 B conf
A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability.
CSL
Vladimir Yu. Sazonov
1994 — conf
On Feasible Numbers.
LCC
Vladimir Yu. Sazonov
1993 — conf
A Construction of Typed Lambda Models Related to Feasible Computability.
Kurt Gödel Colloquium
Vladimir Yu. Sazonov, Andrei Voronkov
1993 J jnl
Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability.
Theor. Comput. Sci.
Vladimir Yu. Sazonov
1989 — conf
A Category of Many-Sorted Algebraic Theories Which is Equivalent to the Category of Categories with Finite Products.
Logic at Botik
Vladimir Yu. Sazonov
1987 B conf
Bounded Set Theory and Polynominal Computability.
FCT
Vladimir Yu. Sazonov
1981 B conf
On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation.
MFCS
Vladimir Yu. Sazonov
1980 B conf
A Logical Approach to the Problem "P=NP?".
MFCS
Vladimir Yu. Sazonov
1980 J jnl
Polynomial Computability and Recursivity in Finite Domains.
J. Inf. Process. Cybern.
Vladimir Yu. Sazonov
1976 B conf
Degrees of Parallelism in Computations.
MFCS
Vladimir Yu. Sazonov
1975 — conf
Sequentially and parallelly computable functionals.
Lambda-Calculus and Computer Science Theory
Vladimir Yu. Sazonov