Bounded Set Theory: some papers available by FTP

• 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. 85--103
• V.Yu.Sazonov, A bounded set theory with anti-foundation 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. 527--541.
• A. P. Lisitsa and V.Yu.Sazonov, Delta-languages for sets and LOGSPACE-computable graph transformers, Theoretical Computer Science (175) 1 (1997), pp. 183--222. (tcs.ps is slightly different from the published version.)
• A. P. Lisitsa and V.Yu.Sazonov, On linear ordering finitely-branching graphs and non-well-founded sets , DIMACS technical Report 97-05, Rutgers University, February 1997. Published also in Proc. of the 4th International Symp. "Logical Foundations of Computer Science", Springer LNCS No1234, pp. 178--188. (Abstract).
• A. P. Lisitsa and V.Yu.Sazonov, Bounded Hyperset Theory and Web-like Data Bases, DIMACS technical Report 97-21, Rutgers University, June 1997. Cf. also Georg Gottlob, Alexander Leitsch, Daniele Mundici (Eds.): Computational Logic and Proof Theory, 5th Kurt G\"odel Colloquium, KGC'97, Vienna, Austria, August 25--29, 1997, Proceedings. Lecture Notes in Computer Science, Vol. 1289, Springer, 1997, pp. 172--185. (Abstract).
• A. P. Lisitsa and V.Yu.Sazonov, Linear ordering on graphs, anti-founded sets and polynomial time computability, in print in a speciall issue of TCS (1999) devoted to the conference LFCS'97, Yaroslavl, Russia, July 1997.