Semantics for dual and symmetric combinatory calculi

Journal of Philosophical Logic 33 (2):125-153 (2004)
We define dual and symmetric combinatory calculi (inequational and equational ones), and prove their consistency. Then, we introduce algebraic and set theoretical relational and operational - semantics, and prove soundness and completeness. We analyze the relationship between these logics, and argue that inequational dual logics are the best suited to model computation
Keywords Philosophy
Categories (categorize this paper)
DOI 10.1023/B:LOGI.0000021709.73522.34
 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,463
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
Haskell B. Curry (1958). Combinatory Logic. Amsterdam: North-Holland Pub. Co..

View all 10 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

7 ( #500,352 of 1,925,522 )

Recent downloads (6 months)

3 ( #254,979 of 1,925,522 )

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.