Number theoretic functions computable by polymorphic programs
- 1 October 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 279-282
- https://doi.org/10.1109/sfcs.1981.24
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A programming language theorem which is independent of Peano ArithmeticPublished by Association for Computing Machinery (ACM) ,1979
- Some results on the length of proofsTransactions of the American Mathematical Society, 1973
- Models and computabilityLecture Notes in Mathematics, 1973
- Normal Form Theorem for Bar Recursive Functions of Finite TypePublished by Elsevier ,1971
- Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematicsProceedings of Symposia in Pure Mathematics, 1962