Decidability of the Natural Numbers with the Almost-All Quantifier
  We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of arithmetic is decidable. 
David Marker and Theodore A. Slaman