Free μ-lattices

This publication has 29 references indexed in Scilit:

• Tree automata, mu-calculus and determinacy
  2002
• The modal mu-calculus alternation hierarchy is strict
  Theoretical Computer Science, 1998
• An initial semantics for the μ-calculus on trees and Rabin's complementation lemma
  Theoretical Computer Science, 1995
• Games and full completeness for multiplicative linear logic
  The Journal of Symbolic Logic, 1994
• Full Abstraction for PCF (extended abstract)
  1994
• A game semantics for linear logic
  Annals of Pure and Applied Logic, 1992
• Linear logic
  Theoretical Computer Science, 1987
• Trees, automata, and games
  1982
• Loopy Games
  1978
• On the non-existence of free complete Boolean algebras
  Fundamenta Mathematicae, 1964