A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
From Monadic Logic to PSL
[chapter]
Pillars of Computer Science
Two major themes of my research have been finite model theory and the automata theoretic approach. Boaz Trakhtenbrot laid the foundations in both areas. In 1950, he proved the undecidability of the satisfiability in the finite problem for first-order logic. His contributions to the automata-theoretic approach are described in this paper. I met Boaz in a seminar in 1981, when I was a doctoral student. Little did I know then that his work would have such a profound impact on my future research.
doi:10.1007/978-3-540-78127-1_36
dblp:conf/birthday/Vardi08
fatcat:jvbned4zxnaide4nv2dsf4xnoa