We study asymptotic probabilities of formal languages specified by logical formulas. We focus on first-order sentences. We prove several results related to the asymptotic tractability of the two-variable fragment. Those results amount to show that asymptotic reasoning with two variables is feasible. We study some applications that are related to temporal reasoning.