The alternation hierarchy for the theory of -lattices

zbMATH Open0987.03057MaRDI QIDQ2770141FDOQ2770141

Authors: Luigi Santocanale 

Publication date: 7 February 2002

Published in: Theory and Applications of Categories (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/121841

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The Variable Hierarchy for the Lattice μ-Calculus
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• scientific article; zbMATH DE number 1136070
• The alternation hierarchy in fixpoint logic with chop is strict too
• scientific article; zbMATH DE number 2102739

zbMATH Keywords

fixed pointsparity gamesalternation hierarchyfree latticesfree \(\mu\)-lattices

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43) Logic in computer science (03B70) Equational classes, universal algebra in model theory (03C05) Categorical logic, topoi (03G30) Free lattices, projective lattices, word problems (06B25)

Cited In (9)

• From parity games to circular proofs
• Theμ-calculus alternation-depth hierarchy is strict on binary trees
• μ-Bicomplete Categories and Parity Games
• The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames
• Title not available (Why is that?)
• The variable hierarchy for the games \(\mu \)-calculus
• Free \(\mu\)-lattices
• On the equational definition of the least prefixed point.
• Ambiguous classes in \(\mu\)-calculi hierarchies

This page was built for publication: The alternation hierarchy for the theory of \(\mu\)-lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770141)