Abstract
The following is a self-contained proof theoretic treatment of two of the principal axiom schemata of current intuitionistic analysis: the axiom of bar induction (Brouwer's bar theorem) and the axiom of continuity. The results are formulated in terms of formal derivability in elementary intuitionistic analysis H(§ 1), so the positive (i.e., derivability) results also apply to elementary classical analysis Z1 (Appendix 1). Both schemata contain the combination of quantifiers νfΛn, where f, g, … are intended to range over free choice sequences of suitable kinds of objects x, y, …; for example, natural numbers or sequences of natural numbers, and n, m, p, r, … over natural numbers (non-negative integers).
Publisher
Cambridge University Press (CUP)
Reference16 articles.
1. Proof theoretic results on intuitionistic higher order arithmetic;Kreisel;this Journal,1962
2. Arithmetical predicates and function quantifiers
3. Independence results in set theory by Cohen's method. II;Feferman;Notices of the American Mathematical Society,1963
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Fan Theorem, its strong negation, and the determinacy of games;Archive for Mathematical Logic;2024-06-06
2. Classical consequences of constructive systems;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2023-04-10
3. Projective sets, intuitionistically;Journal of Logic and Analysis;2022-12-31
4. A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC;The Bulletin of Symbolic Logic;2022-06-09
5. BSL volume 28 issue 2 Cover and Back matter;The Bulletin of Symbolic Logic;2022-06