The succinctness of first-order logic on linear orders

Abstract

Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L/sub 1/ is more succinct than another logic L/sub 2/ if oil properties that can be expressed in L/sub 2/ can be expressed in L/sub 1/ by formulas of (approximately) the same size, but some properties can be expressed in L/sub 1/ by (significantly) smaller formulas. We study the succinctness of logics on linear orders that have the same expressive power as first-order logic. Our first theorem is concerned with the finite variable fragments of first-order logic. We prove that:(i) Up to a polynomial factor, the 2- and the 3-variable fragments of first-order logic on linear orders have the same succinctness.(ii) The 4-variable fragment is exponentially more succinct than the 3-variable fragment. Our second main result compares the succinctness of first-order logic on linear orders with that of monadic second-order logic. We prove that the fragment of monadic second-order logic that has the same expressiveness as first-order logic on linear orders is non-elementarily more succinct than first-order logic.