A Study on Universal Functions
Institut für Numerische Mathematik Und Elektronische Informationsverarbeitung, Universität Innsbruck (1972)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | Recursive functions Programming languages (Electronic computers | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Call number | QA9.615.B82 | |||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links | This entry has no external links. Add one. |
| Through your library | Configure |
H. E. Rose (1984). Subrecursion: Functions and Hierarchies. Oxford University Press.
Joachim Lambek & Philip Scott (2005). An Exactification of the Monoid of Primitive Recursive Functions. Studia Logica 81 (1):1 - 18.
Peter Päppinghaus & Martin Wirsing (1983). Nondeterministic Three-Valued Logic: Isotonic and Guarded Truth-Functions. Studia Logica 42 (1):1 - 22.
Alexandra Shlapentokh (2002). Generalized Weak Presentations. Journal of Symbolic Logic 67 (2):787-819.
G. L. McColm (1989). Some Restrictions on Simple Fixed Points of the Integers. Journal of Symbolic Logic 54 (4):1324-1345.
John N. Crossley & Michael A. E. Dummett (eds.) (1965). Formal Systems and Recursive Functions. Amsterdam, North-Holland Pub. Co..
Stanley S. Wainer (1999). Accessible Recursive Functions. Bulletin of Symbolic Logic 5 (3):367-388.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Erik Ellentuck (1981). Hyper-Torre Isols. Journal of Symbolic Logic 46 (1):1-5.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |

