Abstract.
We study the logical relationship of various forms of induction, as well as quantification operators in applicative theories. In both cases the introduced notion of \(\hbox{\sf N}\)-strictness allows us to obtain the appropriate results.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.Author information
Authors and Affiliations
Additional information
Received: 31 March 1998
Rights and permissions
About this article
Cite this article
Kahle, R. \(\hbox{\sf N}\)-strictness in applicative theories. Arch Math Logic 39, 125–144 (2000). https://doi.org/10.1007/s001530050007
Issue Date:
DOI: https://doi.org/10.1007/s001530050007