Keywords
- Nonempty Subset
- Computation Theory
- Order Type
- Trivial Extension
- Existential Quantifier
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1977 Springer-Verlag
About this chapter
Cite this chapter
Moldestad, J. (1977). Normal computation theories on α. In: Computations in Higher Types. Lecture Notes in Mathematics, vol 574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0087831
Download citation
DOI: https://doi.org/10.1007/BFb0087831
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08132-6
Online ISBN: 978-3-540-37425-1
eBook Packages: Springer Book Archive
