Compact Quantitative Theories of Convex Algebras
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915824042770432 |
|---|---|
| author | Mio, Matteo |
| author_facet | Mio, Matteo |
| contents | We introduce the concept of compact quantitative equational theory. A quantitative equational theory is defined to be compact if all its consequences are derivable by means of finite proofs. We prove that the theory of interpolative barycentric (also known as convex) quantitative algebras of Mardare et. al. is compact. This serves as a paradigmatic example, used to obtain other compact quantitative equational theories of convex algebras, each axiomatizing some distance on finitely supported probability distributions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_04201 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Compact Quantitative Theories of Convex Algebras Mio, Matteo Logic in Computer Science We introduce the concept of compact quantitative equational theory. A quantitative equational theory is defined to be compact if all its consequences are derivable by means of finite proofs. We prove that the theory of interpolative barycentric (also known as convex) quantitative algebras of Mardare et. al. is compact. This serves as a paradigmatic example, used to obtain other compact quantitative equational theories of convex algebras, each axiomatizing some distance on finitely supported probability distributions. |
| title | Compact Quantitative Theories of Convex Algebras |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2511.04201 |