Epimorphisms, definability and cardinalities
Abstract
Generalizing a theorem of Campercholi, we characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures (as opposed to an elementary class). This allows us to strengthen a result of Isbell, as follows: in any prevariety having at most s non-logical symbols and an axiomatization requiring at most m variables, if the epimorphisms into structures with at most m + s + aleph0 elements are surjective, then so are all of the epimorphisms. Using these facts, we formulate and prove manageable "bridge theorems", matching the surjectivity of all epimorphisms in the algebraic counterpart of a logic L with suitable infinitary definability properties of L, while not making the standard but awkward assumption that L comes furnished with a proper class of variables.
Keywords
Cite
@article{arxiv.1801.06647,
title = {Epimorphisms, definability and cardinalities},
author = {T. Moraschini and J. G. Raftery and J. J. Wannenburg},
journal= {arXiv preprint arXiv:1801.06647},
year = {2020}
}