2013
DOI: 10.1215/00294527-1731380
|View full text |Cite
|
Sign up to set email alerts
|

The First-Order Syntax of Variadic Functions

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.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…For any assignment s, if φ(s) is as in (1), then T φ(s) = U φ(s) by Definition 5.7. Thus φ(T ) s = φ(U ) s by (1). By arbitrariness of s, φ(T ) ≡ φ(U ).…”
Section: An Abstract Chain Rulementioning
confidence: 94%
See 1 more Smart Citation
“…For any assignment s, if φ(s) is as in (1), then T φ(s) = U φ(s) by Definition 5.7. Thus φ(T ) s = φ(U ) s by (1). By arbitrariness of s, φ(T ) ≡ φ(U ).…”
Section: An Abstract Chain Rulementioning
confidence: 94%
“…It is also possible to incorporate summation notation formally into Definition 5.3, but the details are complicated. See[1].…”
mentioning
confidence: 99%