Giacomo Lenzi

According to our database1, Giacomo Lenzi authored at least 46 papers between 1996 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 





Topological spaces of monadic MV-algebras.
Soft Comput., 2019

Some Invariant Skeletons for ℓ-u Groups and MV-Algebras.
Order, 2019

Observables on perfect MV-algebras.
Fuzzy Sets and Systems, 2019

The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs.
Theor. Comput. Sci., 2018

Duality Theory and Skeleta for Semisimple MV-Algebras.
Studia Logica, 2018

On the Lattice of the Subvarieties of Monadic MV (C)-algebras.
FLAP, 2018

On semirings and MV-algebras.
Proceedings of the 2017 IEEE International Conference on Fuzzy Systems, 2017

On free MV algebras and a problem of Tarski.
Math. Log. Q., 2016

Bisimulation quantifiers and uniform interpolation for guarded first order logic.
Theor. Comput. Sci., 2015

On generalizing the Nullstellensatz for MV algebras.
J. Log. Comput., 2015

Riesz-McNaughton functions and Riesz MV-algebras of nonlinear functions.
Proceedings of the 2015 IEEE International Conference on Fuzzy Systems, 2015

Algebraic Geometry for MV-Algebras.
J. Symb. Log., 2014

On modal μ-calculus over reflexive symmetric graphs.
J. Log. Comput., 2013

On Modal μ-Calculus in S5 and Applications.
Fundam. Inform., 2013

Algebraically closed MV-algebras and their sheaf representation.
Ann. Pure Appl. Logic, 2013

Projectivity and unification in the varieties of locally finite monadic MV-algebras.
Proceedings of the TACL 2013. Sixth International Conference on Topology, Algebra and Categories in Logic, Vanderbilt University, Nashville, Tennessee, USA, July 28, 2013

Fuzzy Logic as a geometry.
Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, 2013

On Vaught's Conjecture and finitely valued MV algebras.
Math. Log. Q., 2012

On Modal μ-Calculus over Finite Graphs with Small Components or Small Tree Width.
Int. J. Found. Comput. Sci., 2012

On a Priced Resource-bounded Alternating μ-Calculus.
Proceedings of the ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence, Volume 2, 2012

On a positive set theory with inequality.
Math. Log. Q., 2011

On P-transitive graphs and applications
Proceedings of Second International Symposium on Games, 2011

Deciding the existence of uniform interpolants over transitive models.
Arch. Math. Log., 2011

On modal mu-calculus in S5 and applications.
Proceedings of the 26th Italian Conference on Computational Logic, Pescara, Italy, August 31, 2011

On the µ-calculus over transitive and finite transitive frames.
Theor. Comput. Sci., 2010

On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components
Proceedings of the Proceedings First Symposium on Games, 2010

Representation of MV-algebras by regular ultrapowers of [0, 1].
Arch. Math. Log., 2010

A positive set theory with equality revisited.
Mathematical Structures in Computer Science, 2008

A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames.
J. Log. Comput., 2008

The Variable Hierarchy of the µ-Calculus Is Strict.
Theory Comput. Syst., 2007

About a Positive Set Theory With Equality.
Electr. Notes Theor. Comput. Sci., 2007

On modal mu-calculus with explicit interpolants.
J. Applied Logic, 2006

µ-programs, uniform interpolation and bisimulation quantifiers for modal logics.
Journal of Applied Non-Classical Logics, 2006

An axiomatization of bisimulation quantifiers via the mu-calculus.
Theor. Comput. Sci., 2005

The Variable Hierarchy of the µ-Calculus Is Strict.
Proceedings of the STACS 2005, 2005

On Fixpoint Arithmetic and Infinite Time Turing Machines.
Inf. Process. Lett., 2004

On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus.
Fundam. Inform., 2004

On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees.
Computers and Artificial Intelligence, 2002

On the Variable Hierarchy of the Modal µ-Calculus.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Mu-depth 3 is more than 2: a game-theoretic proof.
Mathematical Structures in Computer Science, 2001

Monadic Second Order Logic And Its Fragments.
Electr. Notes Theor. Comput. Sci., 2001

A New Logical Characterization of Büchi Automata.
Proceedings of the STACS 2001, 2001

Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

On the Structure of the Monadic Logic of the Binary Tree.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

A Hierarchy Theorem for the µ-Calculus.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996