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

  • L. Gordeev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 933)


Predicate Logic Relation Algebra Sequent Calculus Proof Search Reduction Chain 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [H]
    E.V.Huntington, New sets of independent postulates..., Trans. Amer. Math. Soc. 35 (1933), pp.274–304MathSciNetGoogle Scholar
  2. [Ł]
    J.Łukasiewicz, The shortest axiom of the implicational calculus of propositions, Proc. Royal Irish Acad. 52 no. 3 (1948), pp.25–33Google Scholar
  3. [M1]
    R.Maddux, A sequent calculus for relation algebras, APAL 25 (1983), pp.73–101Google Scholar
  4. [M2]
    R.Maddux, Nonfinite axiomatizability results for cylindric and relation algebras, JSL 54 (1989), pp.951–974Google Scholar
  5. [M3]
    R.Maddux, Finitary algebraic logic, Zeitschr. f. math. Logic u. Grundl. d. Math. 35 (1989), pp.321–322Google Scholar
  6. [May]
    U.Mayer, Interpretationen und Wachstumsbeispiele, Doctoral dissertation, Tübingen University (1994)Google Scholar
  7. [TG]
    A.Tarski & S.Givant, A Formalization of Set Theory Without Variables, AMS Coll. Publ. 41 (1987)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • L. Gordeev
    • 1
  1. 1.WSI f. Informatik, Math. LogikTübingenGermany

Personalised recommendations