In general, a graph modification problem is defined by a graph modification operation  and a target graph property P. Typically, the modification operation  may be vertex deletion, edge deletion, edge contraction, or edge addition and the question is, given a graph G and an integer k, whether it is possible to transform G to a graph in P after applying the operation  k times on G. This problem has been extensively studied for particular instantiations of  and P. In this paper we consider the general property Pφ of being planar and, additionally, being a model of some First-Order Logic sentence φ (an FOL-sentence). We call the corresponding meta- problem Graph -Modification to Planarity and φ and prove the following algorithmic meta-theorem: there exists a function $f : N^2 → N$ such that, for every  and every FOL sentence φ, the Graph -Modification to Planarity and φ is solvable in $f (k, |φ|) · n^2$ time. The proof constitutes a hybrid of two different classic techniques in graph algorithms. The first is the irrelevant vertex technique that is typically used in the context of Graph Minors and deals with properties such as planarity or surface-embeddability (that are not FOL-expressible) and the second is the use of Gaifman’s Locality Theorem that is the theoretical base for the meta-algorithmic study of FOL-expressible problems.