Giacomo Lenzi

Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, 2013

2012

On Vaught's Conjecture and finitely valued MV algebras.

[BibT_eX]

[DOI]

Antonio Di Nola

Math. Log. Q., 2012

On Modal μ-Calculus over Finite Graphs with Small Components or Small Tree Width.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

On a Priced Resource-bounded Alternating μ-Calculus.

[BibT_eX]

Dario Della Monica

Proceedings of the ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence, Volume 2, 2012

2011

On a positive set theory with inequality.

[BibT_eX]

[DOI]

Math. Log. Q., 2011

On P-transitive graphs and applications

[BibT_eX]

[DOI]

Proceedings of Second International Symposium on Games, 2011

Deciding the existence of uniform interpolants over transitive models.

[BibT_eX]

[DOI]

Arch. Math. Log., 2011

On modal mu-calculus in S5 and applications.

[BibT_eX]

[DOI]

Proceedings of the 26th Italian Conference on Computational Logic, Pescara, Italy, August 31, 2011

2010

On the µ-calculus over transitive and finite transitive frames.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components

[BibT_eX]

[DOI]

Proceedings of the Proceedings First Symposium on Games, 2010

Representation of MV-algebras by regular ultrapowers of [0, 1].

[BibT_eX]

[DOI]

Antonio Di Nola

Luca Spada

Arch. Math. Log., 2010

2008

A positive set theory with equality revisited.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2008

A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames.

[BibT_eX]

[DOI]

J. Log. Comput., 2008

2007

The Variable Hierarchy of the µ-Calculus Is Strict.

[BibT_eX]

[DOI]

Dietmar Berwanger

Erich Grädel

Theory Comput. Syst., 2007

2006

On modal mu-calculus with explicit interpolants.

[BibT_eX]

[DOI]

J. Appl. Log., 2006

µ-programs, uniform interpolation and bisimulation quantifiers for modal logics.

[BibT_eX]

[DOI]

Tim French

J. Appl. Non Class. Logics, 2006

About a Positive Set Theory With Equality.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Logic, Models and Computer Science, 2006

2005

An axiomatization of bisimulation quantifiers via the mu-calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The Variable Hierarchy of the µ-Calculus Is Strict.

[BibT_eX]

[DOI]

Dietmar Berwanger

Proceedings of the STACS 2005, 2005

2004

On Fixpoint Arithmetic and Infinite Time Turing Machines.

[BibT_eX]

[DOI]

Erich Monteleone

Inf. Process. Lett., 2004

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2004

2002

On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 2002

On the Variable Hierarchy of the Modal µ-Calculus.

[BibT_eX]

[DOI]

Dietmar Berwanger

Erich Grädel

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Mu-depth 3 is more than 2: a game-theoretic proof.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2001

Monadic Second Order Logic And Its Fragments.

[BibT_eX]

[DOI]

Proceedings of the GETGRATS Closing Workshop 2001, Bordeaux, France, June 22-23, 2001, 2001

A New Logical Characterization of Büchi Automata.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

The Hierarchy inside Closed Monadic Sigma<sub>1</sub> Collapses on the Infinite Binary Tree.

[BibT_eX]

[DOI]

André Arnold

Jerzy Marcinkowski

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

1999

On the Structure of the Monadic Logic of the Binary Tree.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1996

A Hierarchy Theorem for the µ-Calculus.

[BibT_eX]

[DOI]