Partial Combinatory Algebras of Functions

Notre Dame Journal of Formal Logic 52 (4):431-448 (2011)
We employ the notions of "sequential function" and "interrogation" (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using Longley's preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results is that every realizability topos is a geometric quotient of a realizability topos on a total combinatory algebra
Keywords sequential function   partial combinatory algebra   preorder enriched category
Categories (categorize this paper)
DOI 10.1215/00294527-1499381
 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: 22,660
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

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Lars Birkedal (2002). A General Notion of Realizability. Bulletin of Symbolic Logic 8 (2):266-282.
Solomon Feferman (1995). Definedness. Erkenntnis 43 (3):295 - 320.
Haskell B. Curry (1958). Combinatory Logic. Amsterdam, North-Holland Pub. Co..

Monthly downloads

Added to index


Total downloads

20 ( #205,588 of 1,948,518 )

Recent downloads (6 months)

13 ( #42,403 of 1,948,518 )

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.