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 ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results