Generalisation of disjunctive sequences

Mathematical Logic Quarterly 51 (2):120 (2005)
  Copy   BIBTEX

Abstract

The present paper proposes a generalisation of the notion of disjunctive sequence, that is, of an infinite sequence of letters having each finite sequence as a subword. Our aim is to give a reasonable notion of disjunctiveness relative to a given set of sequences F. We show that a definition like “every subword which occurs at infinitely many different positions in sequences in F has to occur infinitely often in the sequence” fulfils properties similar to the original unrelativised notion of disjunctiveness. Finally, we investigate our concept of generalised disjunctiveness in spaces of Cantor expansions of reals

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,880

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Strict process machine complexity.Ferit Toska - 2014 - Archive for Mathematical Logic 53 (5-6):525-538.
Biologically Unavoidable Sequences.Samuel Alexander - 2013 - Electronic Journal of Combinatorics 20 (1):1-13.
The continuum as a formal space.Sara Negri & Daniele Soravia - 1999 - Archive for Mathematical Logic 38 (7):423-447.
Specker sequences revisited.Jakob G. Simonsen - 2005 - Mathematical Logic Quarterly 51 (5):532-540.
Flat Morley sequences.Ludomir Newelski - 1999 - Journal of Symbolic Logic 64 (3):1261-1279.

Analytics

Added to PP
2013-12-01

Downloads
31 (#740,440)

6 months
8 (#633,132)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Verification of concurrent programs: the automata-theoretic framework.Moshe Y. Vardi - 1991 - Annals of Pure and Applied Logic 51 (1-2):79-98.

Add more references