Abstract
We work in the context of abstract data types, modelled as classes of many-sorted algebras. We develop notions of computability over such data types, in particular notions of primitive recursiveness and μ-recursiveness, which generalize the corresponding classical notions over the natural numbers. We also develop classical and intuitionistic formal systems for theories over such data types, and prove (in the case of universal theories) that if an existential assertion is provable in either of these systems, then it has a primitive recursive selection function. It is a corollary that if a μ-recursive scheme is provably total, then it is extensionally equivalent to a primitive recursive scheme. The methods are proof-theoretical, involving cut elimination. These results generalize to an abstract setting previous results of Parsons and Mints over the natural numbers.
Research supported by SERC Research Grant GR/F 59070 under the Alvey Programme (IKBS 103).
Research supported by SERC Logic for IT Senior Fellowship B/ITF/216.
Research supported by SERC Research Grant GR/F 10606 under the Alvey Programme, and by a grant from the Science & Engineering Research Board of McMaster University.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C.S. Copestake, S.S. Wainer, A proof theoretic approach to the termination of computer programs, Report 26.88, Centre for Theoretical Computer Science, University of Leeds, 1988.
R.L. Constable et al., “Implementing Mathematics with the Nuprl Development System,” Prentice-Hall, 1986.
J.H. Gallier, “Logic for Computer Science,” Harper & Row, 1986.
G. Gentzen, Investigations into logical deduction, in “The Collected Papers of Gerhard Gentzen,” (ed. M.E. Szabo), North-Holland, 1969.
S.C. Kleene, “Introduction to Metamathematics,” North-Holland, 1952.
G. Kreisel, A survey of proof theory II, in “Proc. Second Scandinavian Logic Symposium,” (ed. J.E. Fenstad), North-Holland, 1971.
J.W. Lloyd, “Foundations of Logic Programming,” (Second edition), Springer-Verlag, 1987.
K. Meinke and J.V. Tucker, Universal algebra, in “Handbook of Logic in Computer Science,” (ed. S. Abramsky, D. Gabbay, T. Maibaum), Oxford University Press, 1990 (to appear).
G. Mints, Quantifier-free and one-quantifier systems, J. Soviet Math. 1 (1973), 71–84.
C. Parsons, On a number theoretic choice scheme II, (Abstract), J. Symbolic Logic 36 (1971), p. 587.
C. Parsons, On n-quantifier induction, J. Symbolic Logic 37 (1972), 466–482.
G. Takeuti, “Proof Theory,” (2nd edition), North-Holland, 1987.
J.V. Tucker and J.I. Zucker, “Program Correctness over Abstract Data Types, with Error-State Semantics,” CWI Monograph 6, North-Holland and the Centre for Mathematics and Computer Science (CWI), Amsterdam, 1988.
J. V. Tucker and J. I. Zucker, Horn programs and semicomputable relations on abstract structures, in “Proc. 16th International Colloquium on Automata, Languages and Programming, Stresa, Italy,” Lecture Notes in Computer Science 372, Springer-Verlag, 1989, pp. 745–760.
S.S. Wainer, Computability — logical and recursive complexity, in “Proc. NATO International Summer School on Logic, Algebra and Computation, Marktoberdorf, July–Aug. 1989,” Springer-Verlag, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tucker, J.V., Wainer, S.S., Zucker, J.I. (1990). Provable computable functions on abstract data types. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032065
Download citation
DOI: https://doi.org/10.1007/BFb0032065
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52826-5
Online ISBN: 978-3-540-47159-2
eBook Packages: Springer Book Archive