The First-Order Syntax of Variadic Functions
Logic
2019-11-19 v3
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.
Cite
@article{arxiv.1105.4135,
title = {The First-Order Syntax of Variadic Functions},
author = {Samuel Alexander},
journal= {arXiv preprint arXiv:1105.4135},
year = {2019}
}
Comments
15 pages, 1 table