Department of Computer Science
University of Liverpool
Sazonov at liverpool ac uk
Phone: (+44) (0)151 795-4270
Fax: (+44) (0)151 795-4235
PhD, Novosibirsk University and Institute of Mathematics
of Russian Acad. of Sci., 1979.
My interests focus on applications of logic to computer
I am currently working on Bounded Set Theory
and computability over sets thereby developing a set theoretic
approach to querying (nested, complex) databases, in particular Web like
(semi structured) databases by using an anti-founded version of BST with the
possibility of arbitrary cycling in the membership relation. The latter
roughly corresponding to hyper-links between Web-pages. This is also related
to descriptive complexity and finite model theory. E.g., the typical result
says that queries definable in a set theoretic language are exactly those
computable in polynomial time.
My other interests concern
bounded and feasible arithmetic, including intuitionistic one
(with corresponding realizability approach).
Formerly I worked and still am interested in lambda calculus, domain theory,
sequentiality and degrees of parallelism for finite type continuous
Greenwich Mean Time (GMT)