Skip to main content
Springer Nature Link
Log in

Cut free formalization of logic with finitely many variables. Part I.

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

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

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. E.V.Huntington, New sets of independent postulates..., Trans. Amer. Math. Soc. 35 (1933), pp.274–304

    MathSciNet  Google Scholar 

  2. J.Łukasiewicz, The shortest axiom of the implicational calculus of propositions, Proc. Royal Irish Acad. 52 no. 3 (1948), pp.25–33

    Google Scholar 

  3. R.Maddux, A sequent calculus for relation algebras, APAL 25 (1983), pp.73–101

    Google Scholar 

  4. R.Maddux, Nonfinite axiomatizability results for cylindric and relation algebras, JSL 54 (1989), pp.951–974

    Google Scholar 

  5. R.Maddux, Finitary algebraic logic, Zeitschr. f. math. Logic u. Grundl. d. Math. 35 (1989), pp.321–322

    Google Scholar 

  6. U.Mayer, Interpretationen und Wachstumsbeispiele, Doctoral dissertation, Tübingen University (1994)

    Google Scholar 

  7. A.Tarski & S.Givant, A Formalization of Set Theory Without Variables, AMS Coll. Publ. 41 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. WSI f. Informatik, Math. Logik, Auf der Morgenstelle 10, D-72076, Tübingen, Germany

    L. Gordeev

Authors
  1. L. Gordeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leszek Pacholski Jerzy Tiuryn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gordeev, L. (1995). Cut free formalization of logic with finitely many variables. Part I.. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022252

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49404-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics