Traditional models of computation and algorithms take a constructive approach, essentially considering a transition function over a …

This paper gives an execution trace set based account of computability by imposing restrictions on sets of arbitrary sequences of …

We investigate a modal logic of model change, introducing a new operator which allows for changing the valuation at a particular state …

We describe a strategy-based approach to teaching natural deduction using a notation that emphasises the order in which deductions are …

Incompleteness and undecidability have been used for many years as arguments against automatising the practice of mathematics. The …

Dissertation defense In this talk I gave a very high-level overview of my dissertation project, focussing on the trace-based account of algorithms I eventually set out. I spend the first half of the talk providing an informal description of the account, before discussing details of where the challenges lay in defending it.

Analyses of ‘algorithm’ as ’effective prodecure’ have given us a variety of formal models of computation, which …

Local fact change logic (LFC) models the notion of a unilateral change in a network structure. It adds a single, innocent-looking model …