On the axiomatizability of quantitative algebras

Radu Iulian Mardare, Prakash Panagaden, Gordon Plotkin

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

22 Citations (Scopus)

Abstract

Abstract—Quantitative algebras (QAs) are algebras over metric spaces defined by quantitative equational theories as introduced by us in 2016. They provide the mathematical foundation for metric semantics of probabilistic, stochastic and other quantitative systems. This paper considers the issue of axiomatizability of QAs. We investigate the entire spectrum of types of quantitative equations that can be used to axiomatize theories: (i) simple quantitative equations; (ii) Horn clauses with no more than c equations between variables as hypotheses, where c is a cardinal and (iii) the most general case of Horn clauses. In each case we characterize the class of QAs and prove variety/quasivariety theorems that extend and generalize classical results from model theory for algebras and first-order structures.
Original languageEnglish
Title of host publication2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017
PublisherIEEE
Publication date8 Aug 2017
Article number8005102
ISBN (Electronic)9781509030187
DOIs
Publication statusPublished - 8 Aug 2017
Event32nd Annual ACM/IEEE Symposium on Logic in Computer Science ) - Reykjavik, Finland
Duration: 20 Jun 201723 Jun 2017

Conference

Conference32nd Annual ACM/IEEE Symposium on Logic in Computer Science )
Country/TerritoryFinland
CityReykjavik
Period20/06/201723/06/2017

Fingerprint

Dive into the research topics of 'On the axiomatizability of quantitative algebras'. Together they form a unique fingerprint.

Cite this