English

On the Axiomatizability of Quantitative Algebras

Logic in Computer Science 2018-04-06 v1

Abstract

Quantitative algebras (QAs) are algebras over metric spaces defined by quantitative equational theories as introduced by the same authors in a related paper presented at LICS 2016. These algebras 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 cc equations between variables as hypotheses, where cc 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.

Keywords

Cite

@article{arxiv.1804.01682,
  title  = {On the Axiomatizability of Quantitative Algebras},
  author = {Radu Mardare and Prakash Panangaden and Gordon Plotkin},
  journal= {arXiv preprint arXiv:1804.01682},
  year   = {2018}
}

Comments

34 pages, this is an extended version of the paper with the same title presented at LICS 2017