Similar Items: Existence of strongly proper dyadic subbases
- Domain Representations Induced by Dyadic Subbases
- Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
- Combinatorial Analysis of Dyadic and Quasi-Dyadic Codes
- Proper Functors and Fixed Points for Finite Behaviour
- Strongly Complete Logics for Coalgebras
- On the Strong Equivalences for LPMLN Programs