Vladimir Yu. Sazonov

According to our database, Vladimir Yu. Sazonov authored at least 20 papers between 1975 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2012

The extensional ordering of the sequential functionals.

Dag Normann, Vladimir Yu. Sazonov

Ann. Pure Appl. Log., 2012

2001

D: Set-theoretic query language capturing LOGSPACE.

Alexander Leontjev, Vladimir Yu. Sazonov

Ann. Math. Artif. Intell., 2001

Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach.

Vladimir Yu. Sazonov

Proceedings of the Perspectives of System Informatics, 2001

2000

Capturing LOGSPACE over Hereditarily-Finite Sets.

Alexander Leontjev, Vladimir Yu. Sazonov

Proceedings of the Foundations of Information and Knowledge Systems, 2000

1999

Linear Ordering on Graphs, Anti-Founded Sets and Polynomial Time Computability.

Alexei Lisitsa, Vladimir Yu. Sazonov

Theor. Comput. Sci., 1999

1997

Delta-Languages for Sets and LOGSPACE Computable Graph Transformers.

Alexei Lisitsa, Vladimir Yu. Sazonov

Theor. Comput. Sci., 1997

On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets.

Alexei Lisitsa, Vladimir Yu. Sazonov

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Bounded Hyperset Theory and Web-like Data Bases.

Alexei Lisitsa, Vladimir Yu. Sazonov

Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

1995

Delta-Languages for Sets and sub-PTIME Graphs Transformers.

Vladimir Yu. Sazonov, Alexei Lisitsa

Proceedings of the Database Theory, 1995

1994

On Feasible Numbers.

Vladimir Yu. Sazonov

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability.

Vladimir Yu. Sazonov

Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1993

Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability.

Vladimir Yu. Sazonov

Theor. Comput. Sci., 1993

A Construction of Typed Lambda Models Related to Feasible Computability.

Vladimir Yu. Sazonov, Andrei Voronkov

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1989

A Category of Many-Sorted Algebraic Theories Which is Equivalent to the Category of Categories with Finite Products.

Vladimir Yu. Sazonov

Proceedings of the Logic at Botik '89, 1989

1987

Bounded Set Theory and Polynominal Computability.

Vladimir Yu. Sazonov

Proceedings of the Fundamentals of Computation Theory, 1987

1981

On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation.

Vladimir Yu. Sazonov

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

Polynomial Computability and Recursivity in Finite Domains.

Vladimir Yu. Sazonov

J. Inf. Process. Cybern., 1980

A Logical Approach to the Problem "P=NP?".

Vladimir Yu. Sazonov

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1976

Degrees of Parallelism in Computations.

Vladimir Yu. Sazonov

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975

Sequentially and parallelly computable functionals.

Vladimir Yu. Sazonov

Proceedings of the Lambda-Calculus and Computer Science Theory, 1975