Skip to main content
SpringerLink
Log in

Analytic combinatory calculi and the elimination of transitivity

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We introduce, in a general setting, an ‘‘analytic’’ version of standard equational calculi of combinatory logic. Analyticity lies on the one side in the fact that these calculi are characterized by the presence of combinatory introduction rules in place of combinatory axioms, and on the other side in that the transitivity rule proves to be eliminable. Apart from consistency, which follows immediately, we discuss other almost direct consequences of analyticity and the main transitivity elimination theorem; in particular the Church−Rosser and the leftmostreduction theorems for the associated notions of reduction. The last two sections deal with analytic combinatory calculi with the extensionality rule added. Here, as far as the elimination of transitivity is concerned, we have only partial results, which unfortunately do not cover, at present, full CL + Ext. Yet, they are sufficient to prove the decidability of weaker combinatory calculi with extensionality, including e.g. BCK + Ext.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barendregt, H.P.: The Lambda Calculus, its Syntax and Semantics. Revised edition, North Holland, Amsterdam, 1984

  2. Curry, H.B., Feys, R.: Combinatory Logic. Vol. I, North Holland, Amsterdam, 1972

  3. Curry, H.B., Hindley, J.R., Seldin, J.P.: Combinatory Logic. Vol. II, North Holland, Amsterdam, 1972

  4. Engeler, E.: Foundations of Mathematics: Questions of Analysis, Geometry & Algorithmics. Engl. Transl., Springer, Berlin, 1983

  5. Girard, J-Y., Taylor, P., Lafont, Y.: Proofs and Types. Revised edition, Cambridge University Press, Cambridge, 1990

  6. Hindley, J.R.: Axioms for strong reduction in combinatory logic. J. Symbolic Logic 32, 224–236 (1967)

    MATH  Google Scholar 

  7. Hindley, J.R., Lercher, B., Seldin, J.P.: Introduction to Combinatory Logic. Cambridge University Press, London, 1972

  8. Hindley, J.R., Seldin, J.P.: Introduction to Combinators and λ–Calculus. Cambridge University Press, London, 1986

  9. Klop, J.W.: Term Rewriting Systems. In: Abramsky, S., Gabbay, Dov M., Maibaum, T.S.E., (eds.), Handbook of Logic in Computer Science, Vol. 2, Clarendon Press, Oxford 1992, pp. 1–116

  10. Lercher, B.: The decidability of Hindley’s axioms for strong reduction. J. Symbolic Logic 32, 237–239 (1967)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Philosophy, University of Florence, Via Bolognese, 52-50139, Firenze, Italy

    Pierluigi Minari

Authors
  1. Pierluigi Minari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pierluigi Minari.

Additional information

Mathematics Subject Classification (2000): 03B40, 03F03, 03F07

Rights and permissions

Reprints and permissions

About this article

Cite this article

Minari, P. Analytic combinatory calculi and the elimination of transitivity. Arch. Math. Logic 43, 159–191 (2004). https://doi.org/10.1007/s00153-003-0203-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-003-0203-1

Keywords

Search

Navigation