Linear ordering on graphs, anti-founded sets and polynomial time computability

Theoretical Computer Science

Volumn 224, Issue 1-2, 1999, Pages 173-213

  Lisitsa, Alexei ^a   Sazonov, Vladimir ^a  

^a PROGRAM SYSTEMS INSTITUTE   (Russian Federation)

Author keywords

Anti foundation axiom; Bisimulation; Bounded set theory; Capturing PTIME; Descriptive complexity; Linear ordering; Strongly extensional graphs

Indexed keywords

EID: 0042614613     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00312-0     Document Type: Article

References (39)

1. S. Abiteboul, V. Vianu, Generic computations and its complexity, Proc. 23th ACM Symp. on the Theory of Computing, 1991, pp. 209-219.
2. S. Abiteboul, V. Vianu, Computing with first-order logic, J. Comput. System Sci. 50 (1995) 309-335.
3. S. Abiteboul, V. Vianu, Queries and computation on the web, Database Theory - ICDT'97, 6th Internat. Conf., Delphi, Greece, January 1997, Proc. Lecture Notes in Computer Science, vol. 1186, Springer, Berlin, 1997, pp. 262-275.
4. P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes, No. 14, 1988.
5. J.K. Barwise, Admissible Sets and Structures, Springer, Berlin, 1975.
6. J.K. Barwise, L. Moss, Vicious Circles: On the Mathematics of Circular Phenomena, CSLI Lecture Notes, 1996.
7. J. Van Benthem, A. Montanari, G. D'Agostino, A. Policriti, Modal deduction in second-order logic and set theory - II, ILLC Research Report ML-1996-08.
8. P. Buneman, S. Davidson, G. Hillebrand, D. Suciu, A query language and optimization techniques for unstructured data, Proc. SIGMOD, San Diego, 1996.
9. A. Cobham, The intrinsic computational difficulty of function, in: Y. Bar-Hillel (Ed.), Logic, Methodology and Philosophy of Science II, North-Holland, Jerusalem, pp. 24-30.
10. E. Dahlhaus, Is SETL a suitable language for parallel programming? - a theoretical approach, in: E. Börger et al. (Eds.), CSL'87, Lecture Notes in Computer Science, vol. 329, 1987, pp. 56-63.
11. A. Dawar, S. Lindell, S. Weinstein, Infinitary logic and inductive definability over finite structures, Inform. Comput. 119 (2) (1995) 160-175.
12. T. Fernando, A primitive recursive set theory and AFA: on logical complexity of the largest bisimulation, Report CS-R9213 ISSN 0169-118XCWI P.O.Box 4079, 1009 AB Amsterdam, Netherlands.
13. R.T.P. Fernando, On substitutional recursion over non-well-founded sets, LICS'89, 1989, pp. 273-282.
14. Y. Gurevich, Algebras of feasible functions, Proc. 24th IEEE Conf. on Foundations of Computer Science, 1983, pp. 210-214.
15. Y. Gurevich, S. Shelah, Fixed-point extensions of first-order logic, Ann. Pure Appl. Logic 32 (1986) 265-280.
16. I. Hodkinson, Finite variable logics, Bull. EATCS 51 (1993) 111-140.
17. N. Immerman, Relational queries computable in polynomial time, Proc. 14th ACM Symp. on Theory of Computation, 1982, pp. 147-152.
18. N. Immerman, Relational queries computable in polynomial time, Inform. Control 68 (1986) 86-104.
19. A. Kosky, Observational properties of databases with object identity, Technical Report MS-CIS-95-20. Dept. of Computer and Information Science, University of Pennsylvania, 1995.
20. K. Kuratovski, A. Mostowski, Set Theory, North-Holland Publishing Company, Amsterdam, PWN -Polish Scientific Publishers, Warszawa, 1967.
21. A.P. Lisitsa, V.Yu. Sazonov, Δ-languages for sets and LOGSPACE-computable graph transformers, Theoret. Comput. Sci. 175 (1997) 183-222.
22. A.P. Lisitsa, V.Yu. Sazonov, On linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets, in: S. Adian, A. Nerode (Eds.), Logical Foundations of Computer Science, 4th Internat. Symp., LFCS'97, Yaroslavl, Russia, July 1997, Proc. Lecture Notes in Computer Science, vol. 1234, Springer, Berlin, 1997, pp. 178-185.
23. A.P. Lisitsa, V.Yu. Sazonov, Bounded hyperset theory and web-like data bases, in: G. Gottlob, A. Leitsch, D. Mundici (Eds.), Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, 25-29 August 1997, Proc. Lecture Notes in Computer Science, vol. 1289, Springer, Berlin, 1997, pp. 172-185.
24. A.B. Livchak, Languages of polynomial queries, Raschet i optimizacija teplotehnicheskih ob'ektov s pomosh'ju EVM, Sverdlovsk, 1982, p. 41 (in Russian).
25. M. Mislove, L. Moss, F. Oles, Non-well-founded sets modeled as ideal fixed points, Inform. Comput. 93 (1991) 16-54.
26. Y.N. Moschovakis, Elementary Induction on Abstract Structures, North-Holland, Amsterdam, 1974.
27. M. Otto, Capturing bisimulation-invariant PTIME, in: S. Adian, A. Nerode (Eds.), Logical Foundations of Computer Science, 4th Internat. Symp., LFCS'97, Yaroslavl, Russia, July 1997, Proc. Lecture Notes in Computer Science, vol. 1234, Springer, Berlin, 1997, pp. 294-305.
28. V.Yu. Sazonov, Polynomial computability and recursivity in finite domains, Elektronische Informationsverarbeitung und Kybernetik 16 (7) (1980) 319-323.
29. V.Yu. Sazonov, Collection principle and existential quantifier, Amer. Math. Soc. Transl. 142 (2) (1989) 1-8. (English translation of a paper in Russian published in Logiko-matematicheskie problemy MOZ., Vychislitel'nye sistemy N107, 1985, Novosibirsk, 30-39.)
30. V.Yu. Sazonov, Collection principle and existential quantifier, Amer. Math. Soc. Transl. 142 (2) (1989) 1-8. (English translation of a paper in Russian published in Logiko-matematicheskie problemy MOZ., Vychislitel'nye sistemy N107, 1985, Novosibirsk, 30-39.)
31. V.Yu. Sazonov, Bounded set theory and polynomial computability, All-Union Conf. on Applied Logic, Novosibirsk, 1985, pp. 188-191 (in Russian).
32. V.Yu. Sazonov, Bounded set theory, polynomial computability and Δ-programming, Application Aspects of Mathematical Logic, Computing systems, vol. 122, 1987, pp. 110-132 (In Russian) Cf. also a short English version of this paper in: Lecture Notes in Computer Science, vol. 278, Springer, Berlin, 1987, pp. 391-397.
33. V.Yu. Sazonov, Bounded set theory, polynomial computability and Δ-programming, Application Aspects of Mathematical Logic, Computing systems, vol. 122, 1987, pp. 110-132 (In Russian) Cf. also a short English version of this paper in: Lecture Notes in Computer Science, vol. 278, Springer, Berlin, 1987, pp. 391-397.
34. V.Yu. Sazonov, Bounded set theory and inductive definability, Abstracts of Logic Colloquium'90, JSL 56 (3) (1991) 1141-1142.
35. V.Yu. Sazonov, Hereditarily-finite sets, data bases and polynomial-time computability, TCS 119 Elsevier (1993) 187-214.
36. V.Yu. Sazonov, A bounded set theory with anti-foundation axiom and inductive definability, Computer Science Logic, 8th Workshop, CSL'94 Kazimierz, Poland, September 1994, Selected Papers, Lecture Notes in Computer Science, vol. 933, Springer, Berlin, 1995, pp. 527-541.
37. V.Yu. Sazonov, On bounded set theory (invited talk), in: M.L. Dalla Chiara et al. (Eds.), Logic and Scientific Methods, 10th Internat. Congress of Logic, Methodology and Philosophy of Sciences, vol. 1, Florence, August 1995, Kluwer Academic Publishers, Dordrecht, 1997, pp. 85-103.
38. V.Yu. Sazonov, A.P. Lisitsa, Δ-languages for sets and sub-PTIME graph transformers, Database Theory - ICDT'95, 5th Internat. Conf., Prague, Czech Republic, January 1995, Proc. Lecture Notes in Computer Science, vol. 893, Springer, Berlin, 1995, pp. 125-138.
39. M. Vardi, Complexity of relational query languages, Proc. 14th Symp. on Theory of Computation, 1982, pp. 137-146.