HackerPapers

arXiv:1105.4135math.LO

The First-Order Syntax of Variadic Functions

Samuel Alexander

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
15 pages, 1 table
Journal reference
Notre Dame J. Formal Logic 54, no. 1 (2013), 47-59
DOI
doi:10.1215/00294527-1731380
Subjects
math.LOLogic

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Mar 2013 to Mar 2013.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. As Math Grows More Complex, Will Computers Reign? 1 comment

    • Here is the paper: http://arxiv.org/abs/1105.4135 And here is the formalization of sections 2-3 in Coq: http://www.math.osu.edu/~alexander.421/mech.txt

      xamuelView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.