Skip to main content
SpringerLink
Log in

On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1234))

Included in the following conference series:

Both authors are supported by RFBR (grant 96-01-01717) and by INTAS (grant 93–0972).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, No. 14, 1988

    Google Scholar 

  2. Barwise, J.K.: Admissible Sets and Structures. Springer, Berlin, 1975

    Google Scholar 

  3. Barwise, J.K., Moss, L.: Vicious Circles: on the mathematics of circular phenomena. CSLI Lecture Notes, 1996

    Google Scholar 

  4. Dawar, A., Lindell, S., Weinstein S.: Infinitary Logic and Inductive Definability over Finite Structures. Information and Computation, 119, No. 2 (1995) 160–175

    Google Scholar 

  5. Fernando, T.: 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

    Google Scholar 

  6. Fernando, R.T.P.: On Substitutional Recursion over Non-Well-Founded Sets. LICS'89 (1989) 273–282

    Google Scholar 

  7. Gurevich, Y.: Algebras of feasible functions. Proc. 24th IEEE Conf. on Foundations of Computer Science (1983) 210–214

    Google Scholar 

  8. Gurevich, Y., Shelah, S.: Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic 32 (1986) 265–280

    Google Scholar 

  9. Hodkinson, I.: Finite variable logics. Bulletin of the EATCS, 51 (1993) 111–140

    Google Scholar 

  10. Immerman, N.: Relational queries computable in polynomial time. Proccedings of 14th ACM Symposium on Theory of Computation, (1982) 147–152

    Google Scholar 

  11. Immerman, N.: Relational queries computable in polynomial time. Information and Control 68 (1986) 86–104

    Google Scholar 

  12. Livchak, A.B.: Languages of polynomial queries. Raschet i optimizacija teplotehnicheskih ob'ektov s pomosh'ju EVM, Sverdlovsk, 1982, p. 41 (in Russian)

    Google Scholar 

  13. Mislove, M., Moss L., Oles, F.: Non-Well-Founded Sets Modeled as Ideal Fixed Points. Information and Computation, bf 93 (1991) 16–54

    Google Scholar 

  14. Moschovakis, Y.N.: Elementary Induction on Abstract Structures. Amsterdam, North-Holland, 1974.

    Google Scholar 

  15. Sazonov, V.Yu.: Polynomial computability and recursivity in finite domains. Elektronische Informationsverarbeitung und Kybernetik. 16, N7 (1980) 319–323

    Google Scholar 

  16. Sazonov, V.Yu.: Bounded set theory, polynomial computability and δ-programming. Application aspects of mathematical logic. Computing systems 122 (1987) 110–132 (In Russian) Cf. also a short English version of this paper in: Lect. Not. Comput. Sci. 278 Springer (1987) 391–397

    Google Scholar 

  17. Sazonov, V.Yu.: Bounded set theory and inductive definability. Abstracts of Logic Colloquium'90. JSL 56 No.3 (1991) 1141–1142

    Google Scholar 

  18. Sazonov, V.Yu.: Hereditarily-finite sets, data bases and polynomial-time computability. TCS 119 Elsevier (1993) 187–214

    Google Scholar 

  19. Sazonov, V.Yu.: 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 933 Springer (1995) 527–541.

    Google Scholar 

  20. Sazonov, V.Yu.: On Bounded Set Theory (Invited talk). M.L. Dalla Chiara, et al. (eds.), Logic and Scientific Methods, Volume One of the Tenth International Congress of Logic, Methodology and Philosophy of Sciences, Florence, August 1995, Kluwer Academic Publishers, Dordrecht, 1997, 85–103.

    Google Scholar 

  21. Sazonov, V.Yu., Lisitsa, A.P.: δ-languages for sets and sub-PTIME graph transformers. Database Theory — ICDT'95, 5th International Conference, Prague, Czech Republic, January 1995, Proceedings. Lecture Notes in Computer Science 893 Springer (1995) 125–138

    Google Scholar 

  22. Lisitsa, A.P., Sazonov, V.Yu.: δ-languages for sets and LOGSPACE-computable graph transformers, Theoretical Computer Science, tentatively in Vol. 175, 1997

    Google Scholar 

  23. Vardi, M.: Complexity of relational query languages. Proceedings of 14th Symposium on Theory of Computation (1982) 137–146

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Program Systems Institute of Russian Academy of Sciences, 152140, Pereslavl-Zalessky, Russia

    Alexei Lisitsa & Vladimir Sazonov

Authors
  1. Alexei Lisitsa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir Sazonov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Sergei Adian Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lisitsa, A., Sazonov, V. (1997). On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets. In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-63045-7_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63045-6

  • Online ISBN: 978-3-540-69065-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation