all numbers
every string of numbers from $[h]$ which contains all numbers of $[h]$

 
compact oneway liveness
every pair of $h$tall $2$column graphs of rightward arrows which contain a path from their left to their right column

 
compact twoway liveness
every pair of $h$tall $2$column graphs which contain a path from their left to their right column




 
equal ends
every binary string with identical $h$long prefix and suffix

 
equality
every pair of equal subsets of $[h]$




forest oneway liveness
every string of $h$tall $2$column graphs of nonmerging rightward arrows which contain a path from their leftmost to their righmost column

 
 



functional path
every pair of functions on $[h]$ and pair of points in $[h]$ such that the functions connect the points

 
 
hennie separability
every binary string which can be split into blocks of the form $\mathtt{{1}}(\mathtt{{0}}^*\mathtt{{1}})^{{{\lt}}h1}\mathtt{{0}}^+$ or $\mathtt{{1}}(\mathtt{{0}}^*\mathtt{{1}})^{h1}$




inclusion
every pair of subsets of $[h]$ the first of which is included in the second one

 
 



iterated retrocount
every binary string whose $i.h$th rightmost bit is $\mathtt{{1}}$, for some $i$

 
landau
every unary string whose length is a multiple of every summand in a partition of $h$ with maximum least common multiple

 
length
the unique short unary string of length $h$




list membership
every number and list of numbers from $[h]$ such that the number appears in the list

 
long length
the unique long unary string of length $2^h$

 
membership
every number and set of numbers from $[h]$ such that the number is in the set




monotone set programs
every monotone program of operations on a subset of $[h]$ in which $0$ at start implies $h{}1$ at finish

 
moore separability
every binary string which can be split into blocks of the form $\mathtt{{0}}^*\mathtt{{1}}((\mathtt{{0}}{{+}}\mathtt{{1}})^{h2}\mathtt{{1}})^+$

 
oneway liveness
every string of $h$tall $2$column graphs of rightward arrows which contain a path from their leftmost to their righmost column




ordered list membership
every number and ordered list of numbers from $[h]$ such that the number appears in the list

 
ott separability
every binary string which can be split into blocks of the form $\mathtt{{1}}(\mathtt{{0}}{{+}}\mathtt{{1}})^*\mathtt{{0}}$ or $\mathtt{{1}}((\mathtt{{0}}^*\mathtt{{1}})^{h1})^+$

 
projection
every number, index, and tuple from $[h]$ such that the number is at the indexed entry of the tuple




 
relational path
every pair of binary relations on $[h]$ and pair of points in $[h]$ such that the relations connect the points

 



retrocount
every binary string whose $h$th rightmost bit is $\mathtt{{1}}$

 
separability
every string of subsets of $[h]$ which can be split into blocks so that the first set in each block contains the number of sets after it

 
set programs
every $0$preserving program of operations on a subset of $[h]$




short all numbers
every short string of numbers from $[h]$ which contains all numbers of $[h]$

 
short equal ends
every short binary string with identical $h$long prefix and suffix

 
short retrocount
every short binary string whose $h$th rightmost bit is $\mathtt{{1}}$




twoway liveness
every string of $h$tall $2$column graphs which contain a path from their leftmost to their rightmost column

 
weak landau
every unary string whose length is a multiple of some nontrivial summand in a partition of $h$ with maximum least common multiple

