Rather than describing the concepts that we happen to have in natural languages, my research seeks to describe the concepts that we ought to have by abstracting on the patterns of natural reasoning. Just as the material sciences have devised methods for refining the raw materials of the natural world, philosophical logic employs model theory and proof theory in order to engineer the concepts that are better fit for theory building. In order to extend these traditional methods, I have developed a programmatic methodology for working in hyperintensional semantics in order to draw on the computational power provided by any laptop to rapidly prototype and explore the implications of novel semantic theories (see software for details).

Foundations

Whereas semantics and logic are typically developed for language fragments consisting of the Boolean operators and a small number of novel additions in order to limit the computational complexity required to investigate the resulting theory, this project aims at greater conceptual unity, devising a common semantics and logic for the following operators:

Attempting to develop a unified model theoretic semantics and proof theory for the collection of operators given above is computationally intractable given traditional methods of establishing logical consequences or writing derivations by hand. By contrast, the interactions between the operators given above are readily explored using the programmatic methodology that I have developed in order to support the discovery of adequate semantic theories and their corresponding logics. Instead of limiting these tools to the specific languages with which I am concerned, the model-checker abstracts on the details of my semantics, providing a general programmatic methodology for developing and investigating new semantic theories as well as their corresponding proof systems. In the next phase of this project, I aim to extend this methodology to include the LEAN proof assistance so as to streamline the discovery and description of the logics corresponding to each semantic theory.

These methods in conceptual engineering aim to support the development of a unified logical theory with a broad range of applications, including formal verification and AI safety.

Verification

This project provides a flexible, unified, and intuitive semantics and logic for tense, modal, counterfactual conditional, and constitutive explanatory operators to model system behavior and verify software. Instead of taking possible worlds (i.e., complete histories of the system) and times to be primitive, the semantics models evolutions as appropriately constrained functions from times to instantaneous world states of the system. In order to interpret hyperintensional operators, world states are identified with maximal possible states where in general states may be partial and impossible. A primitive task relation is then taken to distinguish possible and impossible state transitions and is subject to a number of constraints and further generalizations. Finite evolutions are then defined to be functions from an interval of times to states where there is a task from the state at each time in the interval to its successor (if any).

In addition to providing a general semantic framework for interpreting a range of logical operators, this project aims to unify the following logics employed in formal methods by providing a common notation in which the following may be expressed as subsystems given the expressive power of the present semantics:

Temporal logic (in particular, Leslie Lamport’s TLA+) has emerged as a highly practical tool for modeling programs and systems, with adoption and support within major commercial enterprises like AWS, Microsoft, and Oracle. Other tools used in industry, like Microsoft’s Dafny and the Coq formalization of Iris’s higher-order separation logic, rely on Hoare Logic. Classical varieties of Hoare logic are expressively subsumed by dynamic logic, where both dynamic and temporal logic are at bottom modal systems: the result of enriching a standard extensional deductive logic with modal operators. This project aims to both unify and extend this common lineage, providing an intuitive and general framework in which to gain greater perspective on existing logics used in formal verification as well as providing new affordances given the greater expressive power of the hyperintensional semantics that I have developed.

Papers

In Progress