Reverse Mathematics and Π 12 Comprehension
نویسنده
چکیده
This is joint work with Carl Mummert. We initiate the reverse mathematics of general topology. We show that a certain metrization theorem is equivalent to Π 2 comprehension. An MF space is defined to be a topological space of the form MF(P ) with topology generated by {Np | p ∈ P}. Here P is a poset, MF(P ) is the set of maximal filters on P , and Np = {F ∈ MF(P ) | p ∈ F}. If the poset P is countable, the space MF(P ) is said to be countably based. The class of countably based MF spaces can be defined and discussed within the subsystem ACA0 of second order arithmetic. One can prove within ACA0 that every complete separable metric space is homeomorphic to a countably based MF space which is regular. We show that the converse statement, “every countably based MF space which is regular is homeomorphic to a complete separable metric space,” is equivalent to Π 2 -CA0. The equivalence is proved in the weaker system Π 1 -CA0. This is the first example of a theorem of core mathematics which is provable in second order arithmetic and implies Π 2 comprehension.
منابع مشابه
Reverse mathematics and pi12 comprehension
2 Reverse mathematics is a particular program within the foundations of mathematics. The purpose of reverse mathematics is to discover which set existence axioms are needed in order to prove specific theorems of ordinary or core mathematics: real analysis, functional analysis, complex analysis, countable algebra, countable combinatorics, geometry, etc. Often the theorems turn out to be equivale...
متن کاملReverse Mathematics and Π2 Comprehension
This is joint work with Carl Mummert. We initiate the reverse mathematics of general topology. We show that a certain metrization theorem is equivalent to Π 2 comprehension. An MF space is defined to be a topological space of the form MF(P ) with topology generated by {Np | p ∈ P}. Here P is a poset, MF(P ) is the set of maximal filters on P , and Np = {F ∈ MF(P ) | p ∈ F}. If the poset P is co...
متن کاملThe Limits of Determinacy in Second Order Arithmetic: Consistency and Complexity Strength
We prove that determinacy for all Boolean combinations of Fσδ (Π 0 3) sets implies the consistency of second-order arithmetic and more. Indeed, it is equivalent to the statement saying that for every set X and every number n, there exists a β-model of Πn-comprehension containing X. We prove this result by providing a careful level-by-level analysis of determinacy at the finite level of the diff...
متن کاملReverse mathematics of some topics from algorithmic graph theory
This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered. For finite graphs, polynomial time algorithms can be used to find reachability matrices, shortest path matrices, topological sortings an...
متن کاملOpen questions in reverse mathematics
The objective of this paper is to provide a source of open questions in reverse mathematics and to point to areas where there could be interesting developments. The questions I discuss are mostly known and come from somewhere in the literature. My objective was to compile them in one place and discuss them in the context of related work. The list is definitely not comprehensive, and my choice o...
متن کامل