Abstract
The talk will be devoted to four open problems I was unsuccessfully trying to solve in the past. These problems concern:
-
Regular and Context-Free Dynamic Logic;
-
The question of polymorphic collapse;
-
Higher-order push-down stores and procedures;
-
Polymorphic definability of recursive data types.
Each of these problems addresses a basic issue in the logical foundations of computer science, and each has been open for a long time. This talk aims at bringing back the challenge, and sorting out the related confusions.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urzyczyn, P. (2004). My (Un)Favourite Things. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-30124-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23024-3
Online ISBN: 978-3-540-30124-0
eBook Packages: Springer Book Archive