On Guessing Whether A Sequence Has A Certain Property

MaRDI QIDQ3004889zbMATH OpenFDO

Authors Samuel A. Alexander

Publication date 6 June 2011

Full work available at URL https://arxiv.org/abs/1011.6626, https://eudml.org/doc/232224, http://www.emis.de/journals/JIS/VOL14/Alexander/alex2.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

ellipsisguessabilityguessinginteger sequencesnonclassic logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Other applications of logic (03B80) Sequences and sets (11B99)

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.

Recommendations

• On a Curious Property of Counting Sequences
• scientific article; zbMATH DE number 3318590
• scientific article; zbMATH DE number 3459292
• On a class of sequences
• scientific article; zbMATH DE number 3991783
• scientific article; zbMATH DE number 5824234
• scientific article; zbMATH DE number 3941962
• scientific article; zbMATH DE number 1404432
• scientific article; zbMATH DE number 3871450
• On characterization of some sequences

Cited in

(4)

• The first-order syntax of variadic functions
• Guessing fractions of online sequences
• Guessing, mind-changing, and the second ambiguous class
• Club guessing sequences -- natural structures in set theory

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: On Guessing Whether A Sequence Has A Certain Property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004889)