David Janin, Giacomo Lenzi On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees. [Citation Graph (0, 0)][DBLP] Computers and Artificial Intelligence, 2002, v:21, n:3, pp:- [Journal]
Giacomo Lenzi Monadic Second Order Logic And Its Fragments. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2001, v:51, n:, pp:- [Journal]
Giacomo Lenzi About a Positive Set Theory With Equality. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:169, n:, pp:111-120 [Journal]
David Janin, Giacomo Lenzi On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2004, v:61, n:3-4, pp:247-265 [Journal]
Giacomo Lenzi Mu-depth 3 is more than 2: a game-theoretic proof. [Citation Graph (0, 0)][DBLP] Mathematical Structures in Computer Science, 2001, v:11, n:2, pp:273-297 [Journal]