Nathan Bowler

List of Publications

Normal subgroups of infinite symmetric groups, with an application to definability. Nathan Bowler and Thomas Forster. Journal of Symbolic Logic, Volume 74, Issue 1 (2009), 17-26.

Winning an infinite combination of games. Nathan Bowler. Mathematika, Volume 58, Issue 02 (2012) 419-431

Exploring the Boundaries of Monad Tensorability on Set. Nathan Bowler, Sergey Goncharov, Paul Blain Levy and Lutz Schröder. Logical Methods in Computer Science, Volume 9, Issue 3, Paper 22

Coproducts of Monads on Set. Jirí Adámek, Nathan Bowler, Paul Blain Levy, Stefan Milius. Proceedings of the IEEE Symposium on Logic in Computer Science (2012), pages 45-54.

Model Theoretic Connected Components of Finitely Generated Nilpotent Groups. Nathan Bowler, Cong Chen and Jakob Gismatullin. Journal of Symbolic Logic. Volume 78, Issue 1 (2013), 245-259

Matroid Intersection, Base Packing and Base Covering for Infinite Matroids. Nathan Bowler and Johannes Carmesin. Combinatorica (2014).

The Axiom Scheme of Acyclic Comprehension. Zuhair Al-Johar, Nathan Bowler and Randall Holmes. Notre Dame Journal of Formal Logic, Volume 55 (2014), no. 1, pages 11-24.

Matroids with an Infinite Circuit-Cocircuit Intersection. Nathan Bowler and Johannes Carmesin. Journal of Combinatorial Theory, Series B. Volume 107 (2014), no. 0, pages 78-91.

Rudimentary Recursion, Gentle Functions and Provident Sets. Nathan Bowler and Adrian Mathias. To appear in the Notre Dame Journal of Formal Logic (to appear)

Thin Sums Matroids and Duality. Hadi Afzali and Nathan Bowler. To appear in Advances in Mathematics

Self Dual Matroids on Infinite Sets. Nathan Bowler and Stefan Geschke. To appear in the Proceedings of the American Mathematical Society.

Edge-disjoint double rays in infinite graphs: a Halin type result. Nathan Bowler, Johannes Carmesin and Julian Pott. To appear in JCTB.

Submitted:

An Excluded Minors Method for Infinite Matroids. Nathan Bowler and Johannes Carmesin (Submitted to JCTB).

Infinite Matroids and Determinacy of Games. Nathan Bowler and Johannes Carmesin (Submitted to LMS)

The ubiquity of Psi-matroids. Nathan Bowler and Johannes Carmesin (Submitted to EJC).

Infinite Graphic Matroids. Nathan Bowler, Johannes Carmesin and Robin Christian (Submitted to Combinatorica).