“…In fact, a language is locally threshold testable iff it is definable by a first-order formula in the signature {S 1 , S 2 , {P a } a∈Σ } ( [32]), while is locally testable if and only if it is definable by a first-order formula in the signature {S 1 , S 2 , {P a } a∈Σ , lef t, right, top, bottom}, where lef t, right, top, bottom are unary predicates saying that a position is at the respective border [40].…”