The Diagonal Problem for Higher-Order Recursion Schemes is Decidable

Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz. The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. In Martin Grohe, Eric Koskinen, Natarajan Shankar, editors, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016. pages 96-105, ACM, 2016. [doi]

Abstract

Abstract is missing.