2008 |
18 | EE | Giovanna D'Agostino,
Giacomo Lenzi:
A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames.
J. Log. Comput. 18(4): 601-614 (2008) |
17 | EE | Giacomo Lenzi:
A positive set theory with equality revisited.
Mathematical Structures in Computer Science 18(1): 177-188 (2008) |
2007 |
16 | EE | Giacomo Lenzi:
About a Positive Set Theory With Equality.
Electr. Notes Theor. Comput. Sci. 169: 111-120 (2007) |
15 | EE | Dietmar Berwanger,
Erich Grädel,
Giacomo Lenzi:
The Variable Hierarchy of the µ-Calculus Is Strict.
Theory Comput. Syst. 40(4): 437-466 (2007) |
2006 |
14 | EE | Giovanna D'Agostino,
Giacomo Lenzi:
On modal mu-calculus with explicit interpolants.
J. Applied Logic 4(3): 256-278 (2006) |
2005 |
13 | EE | Dietmar Berwanger,
Giacomo Lenzi:
The Variable Hierarchy of the µ-Calculus Is Strict.
STACS 2005: 97-109 |
12 | EE | Giovanna D'Agostino,
Giacomo Lenzi:
An axiomatization of bisimulation quantifiers via the mu-calculus.
Theor. Comput. Sci. 338(1-3): 64-95 (2005) |
2004 |
11 | EE | David Janin,
Giacomo Lenzi:
On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus.
Fundam. Inform. 61(3-4): 247-265 (2004) |
10 | EE | Giacomo Lenzi,
Erich Monteleone:
On Fixpoint Arithmetic and Infinite Time Turing Machines.
Inf. Process. Lett. 91(3): 121-128 (2004) |
2002 |
9 | EE | Dietmar Berwanger,
Erich Grädel,
Giacomo Lenzi:
On the Variable Hierarchy of the Modal µ-Calculus.
CSL 2002: 352-366 |
8 | | David Janin,
Giacomo Lenzi:
On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees.
Computers and Artificial Intelligence 21(3): (2002) |
2001 |
7 | | André Arnold,
Giacomo Lenzi,
Jerzy Marcinkowski:
The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree.
LICS 2001: 157-166 |
6 | | David Janin,
Giacomo Lenzi:
Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy.
LICS 2001: 347-356 |
5 | EE | Giacomo Lenzi:
A New Logical Characterization of Büchi Automata.
STACS 2001: 467-477 |
4 | EE | Giacomo Lenzi:
Monadic Second Order Logic And Its Fragments.
Electr. Notes Theor. Comput. Sci. 51: (2001) |
3 | | Giacomo Lenzi:
Mu-depth 3 is more than 2: a game-theoretic proof.
Mathematical Structures in Computer Science 11(2): 273-297 (2001) |
1999 |
2 | | David Janin,
Giacomo Lenzi:
On the Structure of the Monadic Logic of the Binary Tree.
MFCS 1999: 310-320 |
1996 |
1 | | Giacomo Lenzi:
A Hierarchy Theorem for the µ-Calculus.
ICALP 1996: 87-97 |