Compact Quantitative Equational Theories as Monad Restrictions
Electronic Notes in Theoretical Informatics and Computer Science · 04.11.2026 · Volume 6: Proceedings of MFPS...
DOI: 10.46298/entics.19649 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Notes in Theoretical Informatics and Computer Science, online erschienen am 04.11.2026. Verfasst von Matteo Mio und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Proofs in quantitative algebra are, generally, infinite objects due to the presence of infinitary rules in the deductive apparatus. A quantitative equational theory is called compact if all its consequences are derivable by means of finite proofs, that is, proofs not using any instances of the infinitary rules. This definition is purely logical. In this work we give an equivalent, but categorical, characterisation based on the notion of monad restriction.
Zitieren
APA
Mio, M., & Riba, C. (2026). Compact Quantitative Equational Theories as Monad Restrictions. Electronic Notes in Theoretical Informatics and Computer Science, Volume 6: Proceedings of MFPS.... https://doi.org/10.46298/entics.19649
Vancouver
Mio M, Riba C. Compact Quantitative Equational Theories as Monad Restrictions. Electronic Notes in Theoretical Informatics and Computer Science. 2026;Volume 6: Proceedings of MFPS.... doi:10.46298/entics.19649
BibTeX
@article{Mio2026,
author = {Mio, Matteo and Riba, Colin},
title = {Compact Quantitative Equational Theories as Monad Restrictions},
journal = {Electronic Notes in Theoretical Informatics and Computer Science},
year = {2026},
volume = {Volume 6: Proceedings of MFPS...},
doi = {10.46298/entics.19649}
}
EUVIMED