Affiliation:
1. Fachbereich Mathematik, Technische Universität Darmstadt, Schlossgartenstrasse 7, 64289 Darmstadt, Germany
Abstract
We investigate the strength of the existence of a non-principal ultrafilter over fragments of higher-order arithmetic. Let [Formula: see text] be the statement that a non-principal ultrafilter on ℕ exists and let [Formula: see text] be the higher-order extension of ACA0. We show that [Formula: see text] is [Formula: see text]-conservative over [Formula: see text] and thus that [Formula: see text] is conservative over PA. Moreover, we provide a program extraction method and show that from a proof of a strictly [Formula: see text] statement ∀ f ∃ g A qf(f, g) in [Formula: see text] a realizing term in Gödel's system T can be extracted. This means that one can extract a term t ∈ T, such that ∀ f A qf(f, t(f)).
Publisher
World Scientific Pub Co Pte Lt
Reference21 articles.
1. Nonstandard Methods in Fixed Point Theory
2. An effective proof that open sets are Ramsey
3. J. Avigad, Reverse Mathematics 2001, Lecture Notes in Logic 21 (Association Symbol Logic, La Jolla, CA, 2005) pp. 19–46.
4. Gödel’s Functional (“Dialectica”) Interpretation
5. A. Enayat, Logic in Tehran, Lecture Notes in Logic 26 (Association Symbolic Logic, La Jolla, CA, 2006) pp. 87–113.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献