This paper presents an attempt to bridge the gap between logical and cognitive treatments of strategic reasoning in games. There have been extensive formal debates about the merits of the principle of ...

This is a preview. Log in through your library . Abstract Each closed (i.e. variable free) formula of interpretability logic is equivalent in ILF to a closed formula of the provability logic G, thus ...

Computational logic and formal languages form a cornerstone of modern computer science and mathematics, providing the theoretical framework by which algorithms, automated reasoning systems and even ...

Paul is an incoming assistant professor in computer science at the University of Colorado Boulder (Fall 2026). His research explores the fundamentals of symbolic learning and synthesis, e.g. learning ...