Recent Talks of Neil Immerman

• Descriptive Complexity: Using Logic to Understand Computation, Sackler Lecture, Tel-Aviv University, May 2017.

• Efficiently Reasoning about Programs, Sackler Lecture, Tel-Aviv University, May 2017.

• "FO Isomorphism Theorems"

• "Reasoning About Reachability"

• "Towards Capturing Order-Independent P"

• "Introductory Survey of Descriptive Complexity"

• "The Complexity of Resilience and Responsibility for Conjunctive Queries"

• "Descriptive Complexity: Survey and Recent Progress"

• "Dynamic Reasoning"

• "P versus NP: Approaches, Rebuttals, and Does It Matter?"

• "A Simple Inductive Synthesis Methodology and its Applications"