Partial Combinatory Algebras of Functions

Notre Dame Journal of Formal Logic 52 (4):431-448 (2011)
Abstract 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
Options
 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: 5,701
External links
  •   Try with proxy.
  •   Try with proxy.
  • Through your library Configure

    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..

    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2011-11-05

    Total downloads

    0

    Recent downloads (6 months)

    0

    How can I increase my downloads?


    My notes
    Sign in to use this feature


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

    Other forums