Free \(\mu\)-lattices
From MaRDI portal
Publication:5960406
DOI10.1016/S0022-4049(01)00098-6zbMath0990.06004MaRDI QIDQ5960406
Publication date: 7 April 2002
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
games; category of \(\mu\)-lattices; fix-point; free \(\mu\)-lattices; quasivariety of \(\mu\)-lattices; unary polynomial
91A43: Games involving graphs
03B70: Logic in computer science
68Q55: Semantics in the theory of computing
06B25: Free lattices, projective lattices, word problems
Related Items
μ-Bicomplete Categories and Parity Games, The variable hierarchy for the games \(\mu \)-calculus, Completions of \(\mu \)-algebras, On the equational definition of the least prefixed point., Ambiguous classes in \(\mu\)-calculi hierarchies, \(*\)-\(\mu\)-semirings and \(*\)-\(\lambda\)-semirings, From Parity Games to Circular Proofs, Induction, Coinduction, and Adjoints, Conway Games, Coalgebraically, Equivalences and Congruences on Infinite Conway Games, Least and Greatest Fixpoints in Game Semantics, On the Word Problem for ${\it \Sigma\Pi}$ -Categories, and the Properties of Two-Way Communication
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Games for the \(\mu\)-calculus
- An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
- Results on the propositional \(\mu\)-calculus
- A calculus of communicating systems
- Local model checking in the modal mu-calculus
- A game semantics for linear logic
- On functors expressible in the polymorphic typed lambda calculus
- The modal mu-calculus alternation hierarchy is strict
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Fixed point characterization of infinite behavior of finite-state systems
- Coherence completions of categories
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- On full abstraction for PCF: I, II and III
- Pushdown processes: Games and model-checking
- Matrix and matricial iteration theories. I
- A fixpoint theorem for complete categories
- Free lattices
- Free lattices. II
- A lattice-theoretical fixpoint theorem and its applications
- Loopy Games
- Games and full completeness for multiplicative linear logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- On the non-existence of free complete Boolean algebras
