6 research outputs found
Reverse mathematics of matroids
Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of some basis theorems for matroids and enumerated matroids. Next, using Weihrauch reducibility, we relate the basis results to combinatorial choice principles and statements about vector spaces. Finally, we formalize some of the Weihrauch reductions to extract related reverse mathematics results. In particular, we show that the existence of bases for vector spaces of bounded dimension is equivalent to the induction scheme for \Sigma^0_2 formulas
Reverse Mathematics and Algebraic Field Extensions
This paper analyzes theorems about algebraic field extensions using the
techniques of reverse mathematics. In section 2, we show that
is equivalent to the ability to extend -automorphisms of field extensions to
automorphisms of , the algebraic closure of . Section 3 explores
finitary conditions for embeddability. Normal and Galois extensions are
discussed in section 4, and the Galois correspondence theorems for infinite
field extensions are treated in section 5.Comment: 25 page
Borel quasi-orderings in subsystems of second-order arithmetic
AbstractWe study the provability in subsystems of second-order arithmetic of two theorems of Harrington and Shelah [6] about Borel quasi-orderings of the reals. These theorems turn out to be provable in ATR0, thus giving further evidence to the observation that ATR0 is the minimal subsystem of second-order arithmetic in which significant portion of descriptive set theory can be developed. As in [6] considering the lightface versions of the theorems will be instrumental in their proof and the main techniques employed will be the reflection principles and Gandy forcing