Ultrafilters in reverse mathematics
From MaRDI portal
Publication:2878778
DOI10.1142/S0219061314500019zbMath1301.03018arXiv1109.3902MaRDI QIDQ2878778
Publication date: 5 September 2014
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.3902
ATRACARCAforcingreverse mathematicsconservationconservativeultrafiltershigher orderthird order\(\Pi^1_1\) comprehension
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35)
Related Items (4)
CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC ⋮ Logical metatheorems for abstract spaces axiomatized in positive bounded logic ⋮ The Rado path decomposition theorem ⋮ ON IDEMPOTENT ULTRAFILTERS IN HIGHER-ORDER REVERSE MATHEMATICS
Cites Work
- Unnamed Item
- Ultrafilters and types on models of arithmetic
- An effective proof that open sets are Ramsey
- A combinatorial proof of the dense Hindman's theorem
- Combinatorial Cardinal Characteristics of the Continuum
- Formalizing non-standard arguments in second-order arithmetic
- Hindman's theorem: an ultrafilter argument in second order arithmetic
- Infinitary combinatorics and modal logic
- Divisible Properties and the Stone-Čech Compactification
- Forcing in Proof Theory
- Hindman's theorem, ultrafilters, and reverse mathematics
This page was built for publication: Ultrafilters in reverse mathematics