Elementary Functions and LOOP Programs

Notre Dame Journal of Formal Logic 35 (4):496-522 (1994)
Abstract
We study a hierarchy of Kalmàr elementary functions on integers based on a classification of LOOP programs of limited complexity, namely those in which the depth of nestings of LOOP commands does not exceed two. It is proved that -place functions in can be enumerated by a single function in , and that the resulting hierarchy of elementary predicates (i.e., functions with 0,1-values) is proper in that there are predicates that are not in . Along the way the rudimentary predicates of Smullyan are classified as
Keywords No keywords specified (fix it)
Categories (categorize this paper)
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: 12,068
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.

Citations of this work BETA

No citations found.

Similar books and articles
Zlatan Damnjanovic (1997). Elementary Realizability. Journal of Philosophical Logic 26 (3):311-339.
Cees van Leeuwen (2007). What Needs to Emerge to Make You Conscious? Journal of Consciousness Studies 14 (1):115-136.
Analytics

Monthly downloads

Added to index

2010-08-24

Total downloads

8 ( #179,019 of 1,101,861 )

Recent downloads (6 months)

1 ( #306,556 of 1,101,861 )

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.