We study the computational complexity of the FO model checking problem on interval graphs. i. e. intersection graphs of intervals on the real line. https://www.honeypotkidscrafts.com/product-category/hair-accessories/