Skip to main content
Springer Nature Link
Log in

On bounded theories

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1991)

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

Included in the following conference series:

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. Amir, A., Gabbay, D.: Preservation of expressive completeness in temporal models, Information and Computation 72(1978), 66–83.

    Google Scholar 

  2. Barwise, J.: On Moschovakis closure ordinals, J.Symb.Log. 42(1977), 292–296.

    Google Scholar 

  3. Flum, J.: First-order logic and its extensions, ISILC Logic Conf. Kiel, Lect. Notes in Math. 499(1975), 248–310.

    Google Scholar 

  4. Gabbay, D.: Expressive functional completeness in tense logic, in “Aspects of Philosophical Logic” (Monnich, Ed.), Reidel, Dordrecht (1981), 91–117.

    Google Scholar 

  5. Immerman, N.: Upper and lower bounds for first-order expressibility, J.Comp.Syst.Sciences 25(1982), 76–98.

    Google Scholar 

  6. Immerman, N., Kozen, D.: Definability with a bounded number of bound variables, Information and Computation 83(1989), 121–139.

    Google Scholar 

  7. Immerman, N., Lander, E.: Describing graphs: A first-order approach to Graph Canonization, in: A.Selman (Ed.), Complexity Theory Retrospective, Springer, New York (1990), 59–81.

    Google Scholar 

  8. Poizat, B.: Deux ou trois choses que je sais de L n, J.Symb.Log. 47(1982), 641–658.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität Freiburg, D-7800, Freiburg

    Jörg Flum

Authors
  1. Jörg Flum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Gerhard Jäger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Flum, J. (1992). On bounded theories. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023761

Download citation

  • DOI: https://doi.org/10.1007/BFb0023761

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55789-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics