I am a fourth-year graduate student in the computer science department at the University of Chicago. I am primarily interested in topics at the intersection of logic and computer science. I spent some time researching the relationship between proof complexity and SAT-solvers. More recently, I have been thinking about categorical logic and type theory.
Nathan Mull, Shuo Pang, and Alexander Razborov. On CDCL-based proof systems with the ordered decision strategy. Not yet published, 2019. [ http ]
Nathan Mull, Daniel J. Fremont, and Sanjit A. Seshia. On the Hardness of SAT with Community Structure. In Theory and Applications of Satisfiability Testing -- SAT 2016, pages 141--159. Springer International Publishing, 2016. [ http ]
If you would like to contact me, you can email me at (first letter of my first name followed by last name, no symbols) at uchicago dot edu.