Functional representation of substitution algebras
Logic
2015-03-05 v1
Abstract
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is that it is embeddable in a substitution algebra in which elements are distinguished. Furthermore, conditions in terms of neat embeddings are shown to be equivalent to representability.
Cite
@article{arxiv.1503.01174,
title = {Functional representation of substitution algebras},
author = {Norman Feldman},
journal= {arXiv preprint arXiv:1503.01174},
year = {2015}
}
Comments
8 pages