The Church-Rosser Property in Symmetric Combinatory Logic

Journal of Symbolic Logic 70 (2):536 - 556 (2005)
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
Keywords symmetric combinatory logic   Church-Rosser property   dual combinatory logic   combinatory logic   type theory   substructural logics   structurally free logic   symmetric λ-calculus
Categories (categorize this paper)
DOI 10.2178/jsl/1120224727
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 24,479
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Haskell B. Curry (1958). Combinatory Logic. Amsterdam: North-Holland Pub. Co..
Katalin Bimbó (2009). Combinatory Logic. Stanford Encyclopedia of Philosophy.

Monthly downloads

Added to index


Total downloads

15 ( #296,446 of 1,925,593 )

Recent downloads (6 months)

2 ( #308,517 of 1,925,593 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.