The Power-Set Construction for Tree Algebras

DOI10.46298/lmcs-19(4:9)2023arXiv2207.00563OpenAlexW4388293395MaRDI QIDQ6178675

Achim Blumensath

Publication date: 16 January 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.00563

zbMATH Keywords

distributive lawtree algebraspower-set functor

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata, logics, and infinite games. A guide to current research
• Automata on finite trees
• Automata on infinite trees
• The Vietoris monad and weak distributive laws
• Monad compositions II: Kleisli strength
• Eilenberg Theorems for Free
• On finite monoids having only trivial subgroups