PhD Thesis: An Exegesis of Transcendental Syntax
I was a PhD student at Université Sorbonne Paris Nord from 2019 to June 2024, supervised by Thomas Seiller and Damiano Mazza.
Title
“An exegesis of transcendental syntax”
Abstract
This thesis provides a clarification of Girard’s recent work entitled “transcendental syntax”. Girard suggests a reorganisation and a reinterpretation of concepts of mathematical logic coming from his previous works on linear logic, proof-nets, ludics and geometry of interaction. Unlike the approaches of semantic explanations based on the linguistic nature of logical entities and their evaluation, transcendental syntax suggests to start from the notion of computation as primitive in order to reconstruct mathematical logic, by starting with the proof-nets of linear logic. […]
Research Focus
I also had some reflections on the relation between the computational complexity of (lambda-)terms and Turing machines and boolean circuits (invariance thesis) in the context of implicit computational complexity (ICC) with Damiano Mazza but I mainly worked with Thomas Seiller on deciphering Jean-Yves Girard last project of “transcendental syntax” proposing a new computational foundation for logic based on its works on linear logic (and more especially proof-net theory).