Researcher

Proposed and implemented an interdisciplinary research project at the intersecting theory of algorithms, formal verification, programming language semantics, computability theory and philosophy of computer science. Presented research at four international peer-reviewed conferences in logic, in game theory, and in computer science.

Teaching Assistant

Coordinated with teams of teaching assistants to tutor undergraduate and graduate students in:

- six introductory and intermediate logic courses, covering up to completeness for propositional, first order and modal logic (Phil 250, Phil 251, Phil 254);
- one general analytical philosophy course, covering classic papers in free will, the mind-body problem and personal identity (Phil 80);
- one survey course on philosophy of mathematics (Phil 161).

Primary Instructor

Primary instructor for three undergraduate-level courses in formal philosophy:

- Phil 24E: Philosophy of Algorithms, covering topics in defining algorithms, implementation and identity criteria for algorithms, and natural algorithms. Co-taught with Ben Sparkes.
- Phil 49: Survey of Formal Methods in Philosophy, covering topics in basic set theory, argument analysis, formal logic (propositional, modal and predicate), probability theory, decision theory and game theory. This course was targeted at undergraduate philosophy students with no background in formal methods. Mean teaching evaluation of 4.25/5.
- Phil 150: Mathematical Logic, covering basic set theory, Boolean logic, modal logic and first-order logic. This course was targeted at undergraduate students in philosophy, mathematics, computer science and symbolic systems. Mean teaching evaluation of 4.38/5.

Visiting Scholar

Visiting Scholar in the School of History, Philosophy, Political Science and International Relations at Victoria University of Wellington.

Visiting PhD Student

Guest at the Institute for Logic, Language and Computation. Interacted with researchers and gave a talk at the LIRa seminar.

Visiting Scholar

Interacted with researchers in the Tsinghua logic group, and attended conferences at Tsinghua, Peking University and Southwest University.

Graduate Teaching Assistant

Tutored undergraduate students in three introductory and intermediate logic courses, covering truth tables, tableau methods, natural deduction, syntax and semantics for propositional and first order logic (Phil 101, Phil 222).
Developed and provided support for a natural deduction software package used during teaching (link here).

General Assistant (part-time)

Designed and performed batch operations on CAD files for renaming and updating metadata. Extracted and compiled texture files for use in architectural rendering.

Pigott Scholarship

This competitive award, a gift from the Pigott family, recognizes graduate students in the Humanities whose work is of the highest quality.

Patrick Suppes Fellowship in Philosophy of Science

A fellowship supporting students studying in logic, philosophy of science and related disciplines. Awarded for Stanford’s 2017-18 academic year, and again for the 2018-19 academic year.

H A Montgomery Memorial Prize

A prize for the student who has done the best work in logic over the year.

University of Auckland Masters/Honours/PGDip Scholarship

Awarded to students with a GPA of at least 8 (A average) from their undergraduate degree. Covers all postgraduate course fees, and provides a stipend.

J.C. Butcher Award in Theoretical Computer Science

The “J.C. Butcher Award in Theoretical Computer Science” is an annual award offered by the CDMTCS to a stage three student who has demonstrated excellence in Theoretical Computer Science. The name of the award comes from Professor J.C. Butcher, a distinguished mathematician and computer scientist, who was the first HoD of the (then called) Computer Science Department.

Summer Research Scholarship (Philosophy)

Summer Research Scholarships provide the opportunity to gain research experience by pursuing a project with a researcher.

*Supervisor*: Patrick Girard

The purpose of this project was to investigate Ceteris Paribus First-Order
Modal Logic. The aim was to see how such a logic could be defined and what
features it would have. Much research in modern logic focusses on modal logic. In this, modalities
such as *possibly* or *necessarily* are introduced and given a firm footing through Saul Kripke’s possible world semantics. Logic of preference applies
modal logic to preferences, where the accessibility relation is understood as a
preference between possible worlds.

Ceteris paribus preferences are preferences which hold, all else being
equal. Ceteris paribus modal logic captures *ceteris paribus* by holding a set of formulas constant between worlds.
In this project, we defined a first-order version of ceteris paribus modal
logic.

Summer Research Scholarship (Computer Science)

Summer Research Scholarships provide the opportunity to gain research experience by pursuing a project with a researcher.

*Supervisors*: Jeremy Seligman and Andrew Luxton-Reilly

This project centred on the development of the *Natural Deduction Proof Assistant*, and associated LaTeX package. Logic is taught in a range of courses at the University of Auckland in both the
Faculty of Science and Faculty of Arts. Philosophy 222 (Intermediate Logic)
develops students’ abilities to complete logical deductions by introducing the
method of Natural Deduction.
The method of Natural Deduction used in 222 is more abstract than those taught
in other logic courses, and the style taught at Auckland is unique, and so standard textbooks
are inapplicable. The primary goal of this summer research scholarship was to
create an interactive tool to allow faster and easier creation of Natural Deduction
examples and exercises. To this end, two tasks were achieved.

- First, the method for typesetting examples (using LaTeX) was greatly simplified. The new LaTeX code is more human readable and easier to create.
- Second, an application written in Java was developed to further aid in the creation of examples. This application aims to replicate the pen-and-paper method of Natural Deduction taught in 222.

The Proof Assistant formed the main part of the project, and has reached a state that may be useable by students wishing to study further on their own. It has even been extended beyond the scope of 222 to include a system of modal logic, hybrid logic and a simple implementation of second-order logic.

New Zealand Scholarship (Chemistry and English)

New Zealand Scholarship assessments enable candidates to be assessed against challenging standards and are demanding for the most able candidates in each subject. Assessment is by either a written/spoken examination or by the submission of a portfolio or report of work produced throughout the year.

Dux

Dux is awarded to the student with the highest academic achievement in the final year of schooling.

Hicks Cup for Senior Essay

Awarded to the highest achieving student in Year 13 English.

ASB Bursary

Awarded for outstanding community involvement, either on behalf of the school or under circumstances as determined by the school.