Skip to search formSkip to main contentSkip to account menu

Ehrenfeucht–Mycielski sequence

Known as: Ehrenfeucht-Mycielski sequence 
The Ehrenfeucht–Mycielski sequence is a recursively defined sequence of binary digits with pseudorandom properties, defined by Andrzej Ehrenfeucht… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We study the binary Ehrenfeucht Mycielski sequence seeking a balance between the number of occurrences of different binary… 
2007
2007
We construct non-isomorphic models M, N, e.g. of cardinality aleph_1 such that in the Ehrenfeucht-Fraisse game of length zeta… 
2004
2004
POVOLNÝ, D.: The Guatemalan potato tuber moth (Scrobipalpopsis solanivora Povolný, 1973) before the gateways of europe… 
2003
2003
We study the disjunctive binary sequence introduced by Ehrenfeucht and Mycielski in [1]. The match length associated to the bits… 
2003
2003
In [15], Shelah proclaims the aim of reconstructing model theory, ‘with no use of even traces compactness’. We analyze here one… 
2001
2001
Abstract We prove that the strong Martin conjecture is false. The counterexample is the first-order theory of infinite atomic… 
1997