The Church-Rosser Property in Symmetric Combinatory Logic

Journal of Symbolic Logic 70 (2):536 - 556 (2005)
  Copy   BIBTEX


Symmetic combinatory logic with the symmetric analogue of a combinatorially complete base (in the form of symmetric λ-calculus) is known to lack the Church-Rosser property. We prove a much stronger theorem that no symmetric combinatory logic that contains at least two proper symmetric combinators has the Church-Rosser property. Although the statement of the result looks similar to an earlier one concerning dual combinatory logic, the proof is different because symmetric combinators may form redexes in both left and right associated terms. Perhaps surprisingly, we are also able to show that certain symmetric combinatory logics that include just one particular constant are not confluent. This result (beyond other differences) clearly sets apart symmetric combinatory logic from dual combinatory logic, since all dual combinatory systems with a single combinator or a single dual combinator are Church-Rosser. Lastly, we prove that a symmetric combinatory logic that contains the fixed point and the one-place identity combinator has the Church-Rosser property



    Upload a copy of this work     Papers currently archived: 92,369

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The church-Rosser property in dual combinatory logic.Katalin Bimbó - 2003 - Journal of Symbolic Logic 68 (1):132-152.
Semantics for dual and symmetric combinatory calculi.Katalin Bimbó - 2004 - Journal of Philosophical Logic 33 (2):125-153.
The Church Rosser theorem for strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (4):299-302.
Remarks on the church-Rosser property.E. G. K. López-Escobar - 1990 - Journal of Symbolic Logic 55 (1):106-112.
Coherence in category theory and the Church-Rosser property.C. Barry Jay - 1991 - Notre Dame Journal of Formal Logic 33 (1):140-143.
New sets of postulates for combinatory logics.Barkley Rosser - 1942 - Journal of Symbolic Logic 7 (1):18-27.
Introduction to combinatory logic.J. Roger Hindley - 1972 - Cambridge [Eng.]: University Press. Edited by B. Lercher & J. P. Seldin.
Combinatory logic.Haskell Brooks Curry - 1958 - Amsterdam,: North-Holland Pub. Co..
Combinatory logic.Katalin Bimbó - 2009 - Stanford Encyclopedia of Philosophy.


Added to PP

51 (#314,334)

6 months
17 (#152,720)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Katalin Bimbo
University of Alberta

Citations of this work

No citations found.

Add more citations

References found in this work

Combinatory Logic.Haskell B. Curry, J. Roger Hindley & Jonathan P. Seldin - 1977 - Journal of Symbolic Logic 42 (1):109-110.
Combinators and structurally free logic.J. Dunn & R. Meyer - 1997 - Logic Journal of the IGPL 5 (4):505-537.
Dual combinators bite the dust.R. K. Meyer, K. Bimbó & J. M. Dunn - 1998 - Bulletin of Symbolic Logic 4:463-464.
Semantics for dual and symmetric combinatory calculi.Katalin Bimbó - 2004 - Journal of Philosophical Logic 33 (2):125-153.

View all 6 references / Add more references