Schema theorems without expectations

This paper presents two new schema theorems in which expectations are absent. The first theorem provides confidence intervals for the number of instances of a schema at the next generation. The second gives a lower bound for the same quantity.