On Guessing Whether A Sequence Has A Certain Property

Abstract

A concept of "guessability" is defined for sets of sequences of naturals. Eventually, these sets are thoroughly characterized. To do this, a nonstandard logic is developed, a logic containing symbols for the ellipsis as well as for functions without fixed arity. New proofs are given for some seemingly-unrelated known results.

15 pages (revised to add addendum to give due credit to William Wadge for defining guessability long before me)

References in corpus (1)

• Combinatorial images of sets of reals and semifilter trichotomy

Cited by in corpus (4)

• Highly lopsided information and the Borel hierarchy
• Guessing, Mind-changing, and the Second Ambiguous Class
• A Cantor-Bendixson-like process which detects Delta_2^0
• The First-Order Syntax of Variadic Functions