|Abstract||In this paper we specialize the notion of abstract computational procedure previously introduced for intensionally presented structures to those which are extensionally given. This is provided by a form of generalized recursion theory which uses schemata for explicit definition, conditional definition and least fixed point (LFP) recursion in functionals of type level ≤ 2 over any appropriate structure. It is applied here to the case of potentially infinite (and more general partial) streams as an abstract data type.|
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Dr Claus Brillowski, From Domains Towards a Logic of Universals: A Small Calculus for the Continuous Determination of Worlds.
Colin G. Ellard (2001). Evolutionary and Intellectual Antecedents of Primate Visual Processing Streams. Behavioral and Brain Sciences 25 (1):104-105.
Lars Hallnäs (2006). On the Proof-Theoretic Foundation of General Definition Theory. Synthese 148 (3):589 - 602.
Luciano Floridi (2005). Is Semantic Information Meaningful Data? Philosophy and Phenomenological Research 70 (2):351-370.
Imre Ruzsa (1981). An Approach to Intensional Logic. Studia Logica 40 (3):269 - 287.
G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.
Ljubomir L. Ivanov (1989). Abstract Hierarchies and Degrees. Journal of Symbolic Logic 54 (1):16-25.
Jeffery Zucker (2002). Review: Solomon Feferman, Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams. [REVIEW] Bulletin of Symbolic Logic 8 (4):538-542.
Added to index2009-01-28
Total downloads5 ( #169,995 of 722,874 )
Recent downloads (6 months)0
How can I increase my downloads?