Benjamin G. Rin Curriculum Vitae

CONTACT INFORMATION

E-mail: [email protected] Website: sites.google.com/site/benjaminrin Phone: +31 (0) 6 276 123 98 Skype: benjaminrin Mailing address: Philosophy and Religious Studies, Utrecht University Janskerkhof 13 3512 BL Utrecht, Netherlands

APPOINTMENTS

Universitair Docent, Utrecht University, 2016-present. Researcher/Lecturer, University of Amsterdam/Amsterdam University College. 2015-2016. Lecturer, University of California, Irvine. 2014. Postdoctoral Junior Fellow, University of California, Irvine. 2014.

EDUCATION

PhD, Logic and Philosophy of Science University of California, Irvine – September, 2014. Dissertation: Mathematical Limits and Philosophical Significance of Transfinite Computation Committee: Jeffrey A. Barrett (co-chair), Sean Walsh (co-chair), Kai F. Wehmeier. MA, Logic and Philosophy of Science University of California, Irvine – 2011. BA, Mathematics Bard College – 2006. Senior thesis: The Model Theory of Topoi: Skolemizing Zermelo-Fraenkel Set Theory. Committee: Robert McGrail (Chair), Robert L. Martin, Ethan Bloch

AREAS OF RESEARCH SPECIALIZATION

Philosophical and mathematical logic, computability, philosophy of math

AREAS OF TEACHING COMPETENCE

20th century analytic philosophy, philosophy of science, philosophy of language

PUBLICATIONS

“Koepke Machines and Satisfiability for Infinitary Propositional Languages.” Lecture Notes in Computer Science, Vol. 10307, May 2017, pp. 187-197 (with Merlin Carl and Benedikt Löwe) “Realizability Semantics for Quantified Modal Logic: Generalizing Flagg’s 1985 Construction.” The Review of Symbolic Logic, Vol. 9, Issue 4, December 2016, pp. 752-809 (with Sean Walsh). “Transfinite Recursion and Computation in the Iterative Conception of Set.” Synthese, August 2015, Vol. 192, Issue 8, pp. 2437-2462. “The Computational Strengths of α−tape Infinite Time Turing Machines.” Annals of Pure and Applied Logic. Volume 165, Issue 9, September 2014, pp. 1501-1511. “Actuality in Propositional Modal Logic.” Studia Logica, June 2013, pp. 487-503 (with Kai Wehmeier and Allen Hazen).

PRESENTATIONS “Koepke Machines and Satisfiability for Infinitary Propositional Languages.” Computability in Europe, Turku, 2017. “Realizability Semantics for Quantified Modal Logic.” Colloquium Logicum, Hamburg, 2016. “Computational Complexity on Ordinal Turing Machines.” Computability in Europe, Paris, 2016. “The Computability and Complexity of Infinity.” Invited talk, Mid-summer Night's Colloquium, ILLC, Amsterdam, 2016. “Set-Theoretic and Transfinite Analogues of Epistemic Arithmetic and Flagg Consistency.” Invited talk, Colloquium on Mathematical Logic, ILLC, Amsterdam, 2015. “Computational Complexity and the Million Dollar Question.” Invited talk, Amsterdam University College, 2015. “The Computational Strengths of α−tape Infinite Time Turing Machines.” Invited talk, ILLC, Amsterdam, 2014. “Transfinite Recursion and Computation in the Iterative Conception of Set.” Midwest PhilMath Workshop, Notre Dame, October 2014. “Infinity and Recursion.” History and Philosophy of Infinity, Cambridge, 2013. “On Set-Theoretic and Transfinite Analogues of Epistemic Arithmetic and Flagg Consistency.” Computability in Europe, Milan, 2013. “The Computational Strengths of α−length Infinite Time Turing Machines.” Computability in Europe, Cambridge, 2012. “The Computational Strengths of α−length Infinite Time Turing Machines.” ASL Logic Colloquium, Manchester, 2012.

AWARDS AND GRANTS

Social Sciences Merit Fellowship, University of California, Irvine, 2007-2014 Regents’ Summer Fellowship, University of California, Irvine, Summer 2008, 2011-2014 Analysis Trust grant (for History and Philosophy of Infinity), Fall 2013 Associate Dean’s Fellowship, University of California, Irvine, Fall 2013

SERVICE

Co-organizer, Utrecht Philosophy Lecture series, 2017-present Member, Program Committee (Artificial Intelligence Program, UU), 2016-present Member, Instructor Committee (Artificial Intelligence Program, UU), 2016-present Committee member, Bachelor Theses (Artificial Intelligence program, UU), 2017 Tariq Mouhtadi; Sissi Cao; Nike Lambooij; Celine de Jong; Lucas v. H.S. Pompe Committee member, Capstone Theses (Bachelor program, AUC), 2015-2017 Lotte Bijsterbosch (2017); Tim Alpherts (2016); Eoin Martino Grua (2015) Committee member, Master Theses (ILLC Master of Logic program, UvA), 2015-2016 Kristina Gogoladze; Anna Bellomo; Daniil Frumin; Maaike Zwart; Lorenzo Galeotti Article referee, Topoi, 2016. Article referee, Computability in Europe, 2016. Article referee, Philosophy of Science, 2014. Co-organizer, SoCal PhilMath + PhilLogic + FoM Workshop, 2014.

THESIS SUPERVISION

Bachelor thesis (Artificial Intelligence program, UU), 2017 Tjeu Hendriks, “Modal Circuits”

TEACHING EXPERIENCE (AS INSTRUCTOR)

Utrecht University: Logic for AI (Fall 2017) Upper-division course, modal logic; 85 students. Mathematics for AI (Fall 2017) Lower-division course; 216 students. Mathematics for AI (Spring 2017) Lower-division course; 118 students. Experimental Methods and Statistics (Spring 2017) Upper-division course; 64 students. Logical Complexity (Fall 2016) Upper-division course, computability and complexity theory; 31 students. Logic for AI (Fall 2016) Upper-division course, modal logic; 98 students. Amsterdam University College: Logic, Information Flow, and Argumentation (Spring 2016) Lower-division course; two lecture groups of 20-25 students each. Advanced Logic (Fall 2015) Upper-division course; 7 students. Logic, Information Flow, and Argumentation (Fall 2015) Lower-division course; two lecture groups of 20-25 students each. Logic, Information Flow, and Argumentation (Spring 2015) Lower-division course; three lecture groups of 20-25 students each. University of California, Irvine: Advanced Introduction to Logic (Fall 2014) Upper-division course; 40 students. Introduction to Symbolic Logic (Summer 2014) Lower-division course; 17 students. Introduction to Symbolic Logic (Spring 2014) Lower-division course; 103 students. Critical Reasoning (Summer 2012) Lower-division course; 28 students. Introduction to Symbolic Logic (Summer 2011) Lower-division course; 29 students. TEACHING EXPERIENCE (AS TEACHING ASSISTANT)

University of California, Irvine: Logic courses Introduction to Symbolic Logic (Winter 2014, Spring 2011, Winter 2011, Spring 2009, Winter 2009, Winter 2008) Metalogic (Winter 2013, Winter 2012) Critical Reasoning (Fall 2012, Fall 2008) Introduction to Inductive Logic (Spring 2008) Other courses Computer-Based Research in the Social Sciences (Spring 2013) Probability and Statistics for Social Sciences (Fall 2011) Brain Disorders (Fall 2010) Probability and Statistics for Economics (Spring 2010) Human Memory (Winter 2010)

PROFESSIONAL AFFILIATIONS

Association for Symbolic Logic American Philosophical Association American Mathematical Society