The First-Order Syntax of Variadic Functions
arXiv:1105.4135 · doi:10.1215/00294527-1731380
Abstract
We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.
15 pages, 1 table