Vladimir Sazonov: Some Papers and Publications
Papers on Bounded Set Theory

Vladimir Sazonov,
Collection principle and existential
quantifier,
pages 12,
pages 34,
pages 56,
pages 78,
Amer. Math. Soc. Transl. (2) Vol.142, 1989, pp.18.
(English translation of a paper in Russian published in
Logikomatematicheskie problemy MOZ.,
Vychislitel'nye sistemy N107, 1985, Novosibirsk, 3039.)

Vladimir Sazonov,
Hereditarilyfinite sets, data bases and polynomialtime computability,
Theoretical Computer Science, 119 (1) (1993) pp. 187214

V.Yu.Sazonov,
On
Bounded Set Theory, Invited talk on the 10th International, Congress
on Logic, Methodology and Philosophy of Sciences, Florence, August 1995,
in Volume I: Logic and Scientific Method, Kluwer Academic Publishers, 1997,
pp. 85103

V.Yu.Sazonov,
A
bounded set theory with antifoundation axiom and inductive definability,
L.Pacholski and J.Tiuryn (Eds.). Computer Science Logic. 8th Workshop,
CSL'94, Kazimierz, Poland, Sept. 1994. Selected papers. (Lecture Notes
in Computer Science; vol. 933) Berlin, Springer, 1995, pp. 527541.

A. P. Lisitsa
and V.Yu.Sazonov,
Deltalanguages
for sets and LOGSPACEcomputable graph transformers, Theoretical
Computer Science (175) 1 (1997), pp. 183222. (tcs.ps is slightly different
from the published version.)

A. P. Lisitsa
and V.Yu.Sazonov,
On
linear ordering finitelybranching graphs and nonwellfounded sets ,
DIMACS technical Report 9705, Rutgers University, February 1997.
(Abstract).
Published also in Proc. of the 4th International Symp. "Logical Foundations of Computer
Science", Springer LNCS Vol.1234, pp. 178188.

A. P. Lisitsa
and V.Yu.Sazonov,
Bounded
Hyperset Theory and Weblike Data Bases, DIMACS technical Report
9721, Rutgers University, June 1997
(Abstract).
Cf. also
Georg Gottlob, Alexander
Leitsch, Daniele Mundici (Eds.): Computational Logic and Proof Theory,
5th Kurt G\"odel Colloquium, KGC'97, Vienna, Austria, August 2529, 1997,
Proceedings. Lecture Notes in Computer Science, Vol. 1289, Springer, 1997,
pp. 172185.

A. P. Lisitsa and
V.Yu.Sazonov,
Linear
ordering on graphs, antifounded sets and polynomial time
computability,
Theoretical Computer Science, 224 (12) (1999) pp. 173213.

A.Leontjev and
V.Yu.Sazonov,
Capturing LOGSPACE over HereditarilyFinite Sets,
in: Schewe, K.D., Thalheim, B., (Eds.),
Foundations of Information and Knowledge Systems,
First International Symposium, FoIKS 2000, Burg, Germany, February
1417, 2000 Proceedings,
Lecture Notes in Computer Science.Vol. 1762.
See also
Extended Abstract
in Electronic proceedings of the Workshop on Declarative Programming with Sets,
Paris, France, September 28, 1999. The
extended version
is in
Annals of Mathematics and Artificial Intelligence
(AMAI) 33: 309345, 2001, Kluwer Academic Publishers.

V.Yu.Sazonov,
Weblike Databases, AntiFounded Sets and Inductive Definability,
Programmirovanie, 1999, N 5. pp. 2643 (In Russian; this journal
being translaled in English).

V.Yu.Sazonov,
Using Agents for Concurrent Querying of Weblike
Databases via a HypersetTheoretic Approach,
Andrei Ershov Fourth International Conference,
Perspectives of System Informatics, PSI'01,
3  6 July 2001, Novosibirsk, Russia,
Springer Lecture Notes in Computer Science,
2244 (2001) 378394.

V. Guzev, V.Yu.Sazonov and Yu. Serdyuk,
Distributed querying of Web by using dynamically created mobile agents
(Slides), 2002 (Supported by an RDF grant from The University of Liverpool)

V.Yu.Sazonov,
Querying Hyperset/WebLike Databases
,
See the final version in Logic Journal IGPL, 2006; 14: 785814.
See also
slides
of a talk in LAAW02  Logic and Databases, Cambridge, 27 Feb  3 Mar 2006.

A. P. Lisitsa
and
V.Yu.Sazonov,
Bounded MultiHyperSet Theory and Polynomial Computability.

R. Molyneux
and
V.Yu.Sazonov,
Hyperset/Weblike Databases and the Experimental Implementation of the Query Language Delta,
In: Edited Filipe J, Helfert M and Shishkov B (eds) ed(s) 'ICSOFT'2007,
Proceedings of the Second International Conference on Software and Data Technologies'.
INSTICC – Institute for Systems and Technologies of Information, Control and Communication,
Barcelona, 2007, pp 2937. See also Appendix
containing, in particular, the full syntax of Delta and an implemented query system available online, as well as examples of queries
from the paper to run.

R. Molyneux
and
V.Yu.Sazonov,
Hyperset Approach to Semistructured Databases:
Computation of Bisimulation in the Distributed Case,
In:
Sexton A. P. (Ed.). Dataspace: The Final Frontier, 26th British National Conference on Databases,
BNCOD 26, Birmingham, UK, July 2009 Proceedings. LNCS 5588, SpringerVerlag, Berlin Heidelberg, pp. 7890.
Other papers

Vladimir Sazonov,
Polynomial computability and recursivity in finite domains,
Elektronische Informationsverarbeitung und Kybernetik,
Vol.16, N7, 1980, p.319323,
Page 1,
Page 2,
Page 3,
Page 4,
Page 5

Vladimir Sazonov,
A logical approach to the problem "P=?NP",
in:
MFCS'80, Lecture Notes in Computer Science, N88, Springer, New
York, 1980, P.562575. (An important correction to this paper is
given in
[On existence of complete predicate calculus in
metamathematics without exponentiation, MFCS'81, Lecture Notes in
Computer Science, N118, Springer, New York, 1981, P.483490.], P.490.)
Thanks to Bonifác Donát for providing the pdf file of this paper.

Vladimir Sazonov,
An equivalence between polynomial constructivity of
Markov's principle and the equality P=NP,
Siberian Advances in Mathematics, 1991, v.1, N4, pp. 92121,
PDF (3.3Mb),
Doc (8.4Mb) of higher resolution.
(English translation of a paper in Russian published in
Matematicheskaja logika i algoritmicheskie problemy, Trudy Instituta
matematiki SO AN SSSR, 12, Novosibirsk, ``Nauka'', Sibirskoe
otdelenie, 1989, pp. 138165.)

V.Yu.Sazonov,
On
Feasible Numbers, in: Leivant D., ed., Logic and Computational
Complexity, LNCS Vol. 960, Springer, 1995, pp.3051. Cf. also
slides
where, in particular, it is briefly discuseed `What is Mathematics'.

V.Yu.Sazonov,
and A.Voronkov,
A
construction of typed lambda models related to feasible computability,
Georg Gottlob, Alexander Leitsch, Daniele Mundici (Eds.). Computational
Logic and Proof Theory. Proceedings of the Third Kurt G\"odel Colloquium,
KGC'93. (Lecture Notes in Computer Science; vol. 713) Berlin, Heidelberg,
New York: Springer, 1993, pp. 301313.

V.Yu.Sazonov,
and A.Voronkov,
A
construction of typed lambda models related to feasible computability (draft
of an extended version),

V.Yu.Sazonov,
and D.I.Sviridenko,
Abstract
Deducibility and Domain Theory, DIMACS technical Report 9608,
Rutgers University, May 1996.
(Abstract).

V.Yu.Sazonov,
An
Inductive definition and domain theoretic properties of fully abstract models for PCF and PCF+
,
Logical Methods in Computer Science vol 3 issue 3:7 pp 150. DOI: 10.2168/LMCS3(3:7)2007

V.Yu.Sazonov,
Natural nondcpo Domains and fspaces,
Slides for Novosibirsk, Domains VIII, Workshop, September 2007.

V.Yu.Sazonov,
On Natural nondcpo Domains,
Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th
Birthday, Arnon Avron, Nachum Dershowitz, and Alexander Rabinovich, editors, Lecture Notes in
Computer Science, vol. 4800, © Springer Berlin / Heidelberg 2008, pages 620634. (See the whole volume in
http://www.springerlink.com/content/w23475760624/)

V. Sazonov,
Natural
nondcpo domains and fspaces,
Annals of Pure and Applied Logic
159 (2009) pp. 341355. (Available online 30 November 2008; doi:10.1016/j.apal.2008.09.027)

D. Normann, V.Yu. Sazonov, The extensional ordering of the sequential functionals,
Annals of Pure and Applied Logic 163 (2012), pp. 575603
DOI information: 10.1016/j.apal.2011.06.013
(Available online 20 July 2011.)
Download at:
http://dx.doi.org/10.1016/j.apal.2011.06.013