Abstract
T0 will denote Gödel's theory T[3] of functionals of finite type (f.t.) with intuitionistic quantification over each f.t. added. T1 will denote T0 together with definition by bar recursion of type o, the axiom schema of bar induction, and the schemaof choice. Precise descriptions of these systems are given below in §4. The main results of this paper are interpretations of T0 in intuitionistic arithmetic U0 and of T1 in intuitionistic analysis is U1. U1 is U0 with quantification over functionals of type (0,0) and the axiom schemata AC00 and of bar induction.
Publisher
Cambridge University Press (CUP)
Reference10 articles.
1. Tait W. W. , A second order theory of functionals of higher type (to appear).
2. �ber Definitionsbereiche von- Funktionen
Cited by
387 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Focusing on Refinement Typing;ACM Transactions on Programming Languages and Systems;2023-12-20
2. Shape-Constrained Array Programming with Size-Dependent Types;Proceedings of the 11th ACM SIGPLAN International Workshop on Functional High-Performance and Numerical Computing;2023-08-30
3. Weak Similarity in Higher-Order Mathematical Operational Semantics;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. A Formal Proof of the Strong Normalization Theorem for System T in Agda;Electronic Proceedings in Theoretical Computer Science;2023-03-23
5. Towards a Higher-Order Mathematical Operational Semantics;Proceedings of the ACM on Programming Languages;2023-01-09