We consider two orthogonal points of view on finite permuta-tions, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of view). For each of them, we define a corresponding first-order logical the-ory, that we call TOTO (Theory Of Two Orders) and TOOB (Theory Of One Bijection) respectively. We consider various expressibility questions in these theories.
Our main results go in three different directions. First, we prove that, for all k ≥ 1, the set of k-stack sortable permuta-tions in the sense of We s t is expressible in TOTO, and that a logical sentence describing this set can be obtained automati-cally. Previously, descriptions of this set were only known for k ≤ 3. Next, we characterize permutation classes inside which it is possible to express in TOTO that some given points form a cycle. Lastly, we show that sets of permutations that can be described both in TOOB and TOTO are in some sense trivial. This gives a mathematical evidence that permutations-as-bijections and permutations-as-words are somewhat different objects.