Preview
Unable to display preview. Download preview PDF.
References
Friedman,H. Axiomatic recursive function theory, in: R. Gandy and M. Yates (eds), Logic Colloquium '69, North Holland, Amsterdam (1971), 113–137.
Kreissl,G., J. Krivine, Elements of Matnematical Logic, North-Holland, Amsterdam (1967).
Moschovakis,Y. Axioms for computation theories — first draft, in: R. Gandy and M. Yates (eds), Logic Colloquium '69, North Holland, Amsterdam (1971), 199–255.
Rogers,H. Theory of recursive functions and effective operations, McGrawHill (1967).
Rosser, J. A mathematical logic without variables, Ann. of Math. ser.2, 36 (1936), 127–150.
Strong,H. Algebraically generalized recursive function theory, IBM J.Research and Development (1968), 465–475.
-. Construction of models for algebraically generalized recursive function theory, J.Symbolic Logic 35 (1970), 401–409.
Wagner, E.. Uniform reflexive structures: on the nature of Gödelizations and relative computability, Trans.Amer. Math.Soc.144 (1969), 1–41.
Troelstra,A, et al. Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics 344, Springer (1973).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barendregt, H. (1975). Normed uniformly reflexive structures. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029531
Download citation
DOI: https://doi.org/10.1007/BFb0029531
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07416-8
Online ISBN: 978-3-540-37944-7
eBook Packages: Springer Book Archive