论文信息 - The First-Order Syntax of Variadic Functions

The First-Order Syntax of Variadic Functions

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.

Samuel Alexander | S. Alexander

[1] M. V. Boom,et al. The effective Borel hierarchy , 2007 .

[2] Mayer Goldberg,et al. A Variadic Extension of Curry's Fixed-Point Combinator , 2005, High. Order Symb. Comput..

[3] D. Friedman,et al. From Variadic Functions to Variadic Relations A miniKanren Perspective , 2006 .

[4] Patrick Dehornoy,et al. Braids and self-distributivity , 2000 .

[5] S. Alexander. On Guessing Whether a Sequence has a Certain Property , 2010, 1011.6626.

[6] J. Paris,et al. Accessible Independence Results for Peano Arithmetic , 1982 .

[7] Russell O'Connor. Essential Incompleteness of Arithmetic Verified by Coq , 2005, TPHOLs.