Partial Combinatory Algebras of Functions

Simple item page
dc.creatorvan Oosten, Jaap
dc.date2009-05-16
dc.date.accessioned2026-07-07T13:15:53Z
dc.date.available2026-07-07T13:15:53Z
dc.descriptionWe 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 J. 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 quotient of a realizability topos on a total combinatory algebra.
dc.description17 pages
dc.identifierhttps://arxiv.org/abs/0905.2665
dc.identifierhttp://arxiv.org/abs/0905.2665
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230618
dc.subjectLogic
dc.subject03B40,68N18
dc.titlePartial Combinatory Algebras of Functions
dc.typetext

Files

Collections

arXiv